Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization
Article
Article Title | Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization |
---|---|
ERA Journal ID | 3609 |
Article Category | Article |
Authors | Qi, Xuemei (Author), Wang, Hongtao (Author), Zhu, Haihong (Author), Zhang, Ji (Author), Chen, Fulong (Author) and Yang, Jie (Author) |
Journal Title | International Journal of Production Research |
Journal Citation | 54 (16), pp. 4957-4972 |
Number of Pages | 16 |
Year | 2016 |
Place of Publication | United Kingdom |
ISSN | 0020-7543 |
1366-588X | |
Digital Object Identifier (DOI) | https://doi.org/10.1080/00207543.2016.1150615 |
Web Address (URL) | http://www.tandfonline.com/doi/full/10.1080/00207543.2016.1150615 |
Abstract | A fast local neighbourhood search (FLNS) algorithm is proposed in this paper to minimise the total flow time in the nowait flow shop scheduling problem, which is known to be NP-hard for more than two machines. In this work, an |
Keywords | no-wait flow shop scheduling; local neighbourhood search; total flow time; statistical analysis |
ANZSRC Field of Research 2020 | 469999. Other information and computing sciences not elsewhere classified |
Public Notes | Files associated with this item cannot be displayed due to copyright restrictions. |
Byline Affiliations | Anhui Normal University, China |
Faculty of Health, Engineering and Sciences | |
Institution of Origin | University of Southern Queensland |
https://research.usq.edu.au/item/q3654/fast-local-neighborhood-search-algorithm-for-the-no-wait-flow-shop-scheduling-with-total-flow-time-minimization
1750
total views9
total downloads5
views this month0
downloads this month