New heuristics for no-wait flowshops to minimize makespan
- 31 July 2003
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 30 (8), 1219-1231
- https://doi.org/10.1016/s0305-0548(02)00068-0
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- A new heuristic and dominance relations for no-wait flowshops with setupsComputers & Operations Research, 2001
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover timesJournal of the Operational Research Society, 2001
- No-wait and separate setup three-machine flowshop with total completion time criterionInternational Transactions in Operational Research, 2000
- Total flowtime in no-wait flowshops with separated setup timesComputers & Operations Research, 1998
- Genetic algorithms applied to the continuous flow shop problemComputers & Industrial Engineering, 1996
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOperations Research, 1996
- Solvable Cases of the No-wait Flow-shop Scheduling ProblemJournal of the Operational Research Society, 1991
- Heuristic algorithms for continuous flow-shop problemNaval Research Logistics (NRL), 1990
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion timesNaval Research Logistics Quarterly, 1982
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972