A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion
Authors:
- Xiaobing FengXFXiaobing Feng
- Fei ZhaoFZFei Zhao
- Gedong JiangGJGedong Jiang
- Tao TaoTTTao Tao
- Xuesong MeiXMXuesong Mei
- 6 October 2023
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Abstract
No abstract availableKeywords
Funding Information
- National Key Research and Development Program of China (2018AAA0101802)
This publication has 39 references indexed in Scilit:
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardinessComputers & Operations Research, 2015
- New hard benchmark for flowshop scheduling problems minimising makespanEuropean Journal of Operational Research, 2015
- A scatter search algorithm for the distributed permutation flowshop scheduling problemEuropean Journal of Operational Research, 2014
- A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problemInternational Journal of Production Research, 2014
- 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
- Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆Omega, 2010
- Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristicsComputers & Operations Research, 2008
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985