Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm
Authors:
- Biao ZhangBZBiao Zhang
- Chao LuCLChao Lu
- Lei-Lei MengLei-Lei Meng
- Yu-Yan HanYHYu-Yan Han
- Hong-Yan SangHSHong-Yan Sang
- Xu-Chu JiangXJXu-Chu Jiang
- 13 January 2023
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 217
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (52175490, 52205529)
- Liaocheng University (LCUGYTD2022-03)
- Natural Science Foundation of Shandong Province (ZR2021QE195, ZR2021QF036)
This publication has 34 references indexed in Scilit:
- Permutation flowshop group scheduling with position-based learning effectComputers & Industrial Engineering, 2016
- The irace package: Iterated racing for automatic algorithm configurationOperations Research Perspectives, 2016
- Solving the multi-objective flowline manufacturing cell scheduling problem by hybrid harmony searchExpert Systems with Applications, 2015
- A scatter search algorithm for the distributed permutation flowshop scheduling problemEuropean Journal of Operational Research, 2014
- Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle timesInternational Journal of Production Research, 2014
- Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problemsEuropean J. of Industrial Engineering, 2014
- Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithmInternational Journal of Production Research, 2013
- An efficient tabu search algorithm for the distributed permutation flowshop scheduling problemInternational Journal of Production Research, 2013
- The distributed permutation flowshop scheduling problemComputers & Operations Research, 2010
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009