A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
Authors:
- Fuqing ZhaoFZFuqing Zhao
- Lixin ZhangLZLixin Zhang
- Yi ZhangYZYi Zhang
- Weimin MaWMWeimin Ma
- Chuck ZhangCZChuck Zhang
- Houbin SongHSHoubin Song
- 1 May 2020
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 146
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 37 references indexed in Scilit:
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problemComputers & Operations Research, 2013
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machineComputers & Operations Research, 2012
- A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterionInternational Journal of Production Research, 2011
- The flow shop problem with no-idle constraints: A review and approximationEuropean Journal of Operational Research, 2009
- Some heuristic algorithms for total tardiness minimization in a flowshop with blockingOmega, 2009
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- A comprehensive review and evaluation of permutation flowshop heuristicsEuropean Journal of Operational Research, 2005
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion timesNaval Research Logistics Quarterly, 1982