No Cover Image

Journal article 706 views

An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem

Masood Fathi, Amir Nourmohammadi, Amos H.C. Ng, Anna Syberfeldt, Hamid Eskandari Orcid Logo

Engineering Computations, Volume: 37, Issue: 2, Pages: 501 - 521

Swansea University Author: Hamid Eskandari Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1108/ec-02-2019-0053

Published in: Engineering Computations
ISSN: 0264-4401
Published: Emerald 2019
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa53772
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2020-03-25T19:47:37Z
last_indexed 2020-10-16T03:06:50Z
id cronfa53772
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2020-10-15T17:02:53.0382445</datestamp><bib-version>v2</bib-version><id>53772</id><entry>2019-08-09</entry><title>An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem</title><swanseaauthors><author><sid>d2a47b056b55373889a9d19d2924f634</sid><ORCID>0000-0002-5515-9399</ORCID><firstname>Hamid</firstname><surname>Eskandari</surname><name>Hamid Eskandari</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2019-08-09</date><deptcode>BBU</deptcode><abstract/><type>Journal Article</type><journal>Engineering Computations</journal><volume>37</volume><journalNumber>2</journalNumber><paginationStart>501</paginationStart><paginationEnd>521</paginationEnd><publisher>Emerald</publisher><issnPrint>0264-4401</issnPrint><keywords/><publishedDay>9</publishedDay><publishedMonth>8</publishedMonth><publishedYear>2019</publishedYear><publishedDate>2019-08-09</publishedDate><doi>10.1108/ec-02-2019-0053</doi><url/><notes/><college>COLLEGE NANME</college><department>Business</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>BBU</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2020-10-15T17:02:53.0382445</lastEdited><Created>2019-08-09T00:00:00.0000000</Created><path><level id="1">Faculty of Humanities and Social Sciences</level><level id="2">School of Management - Business Management</level></path><authors><author><firstname>Masood</firstname><surname>Fathi</surname><order>1</order></author><author><firstname>Amir</firstname><surname>Nourmohammadi</surname><order>2</order></author><author><firstname>Amos H.C.</firstname><surname>Ng</surname><order>3</order></author><author><firstname>Anna</firstname><surname>Syberfeldt</surname><order>4</order></author><author><firstname>Hamid</firstname><surname>Eskandari</surname><orcid>0000-0002-5515-9399</orcid><order>5</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2020-10-15T17:02:53.0382445 v2 53772 2019-08-09 An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem d2a47b056b55373889a9d19d2924f634 0000-0002-5515-9399 Hamid Eskandari Hamid Eskandari true false 2019-08-09 BBU Journal Article Engineering Computations 37 2 501 521 Emerald 0264-4401 9 8 2019 2019-08-09 10.1108/ec-02-2019-0053 COLLEGE NANME Business COLLEGE CODE BBU Swansea University 2020-10-15T17:02:53.0382445 2019-08-09T00:00:00.0000000 Faculty of Humanities and Social Sciences School of Management - Business Management Masood Fathi 1 Amir Nourmohammadi 2 Amos H.C. Ng 3 Anna Syberfeldt 4 Hamid Eskandari 0000-0002-5515-9399 5
title An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
spellingShingle An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
Hamid Eskandari
title_short An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
title_full An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
title_fullStr An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
title_full_unstemmed An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
title_sort An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
author_id_str_mv d2a47b056b55373889a9d19d2924f634
author_id_fullname_str_mv d2a47b056b55373889a9d19d2924f634_***_Hamid Eskandari
author Hamid Eskandari
author2 Masood Fathi
Amir Nourmohammadi
Amos H.C. Ng
Anna Syberfeldt
Hamid Eskandari
format Journal article
container_title Engineering Computations
container_volume 37
container_issue 2
container_start_page 501
publishDate 2019
institution Swansea University
issn 0264-4401
doi_str_mv 10.1108/ec-02-2019-0053
publisher Emerald
college_str Faculty of Humanities and Social Sciences
hierarchytype
hierarchy_top_id facultyofhumanitiesandsocialsciences
hierarchy_top_title Faculty of Humanities and Social Sciences
hierarchy_parent_id facultyofhumanitiesandsocialsciences
hierarchy_parent_title Faculty of Humanities and Social Sciences
department_str School of Management - Business Management{{{_:::_}}}Faculty of Humanities and Social Sciences{{{_:::_}}}School of Management - Business Management
document_store_str 0
active_str 0
published_date 2019-08-09T04:06:54Z
_version_ 1763753500662038528
score 11.017797

Similar Items