A new heuristic and dominance relations for no-wait flowshops with setups
- 31 May 2001
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 28 (6) , 563-584
- https://doi.org/10.1016/s0305-0548(99)00136-7
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A review of scheduling research involving setup considerationsOmega, 1999
- Total flowtime in no-wait flowshops with separated setup timesComputers & Operations Research, 1998
- Job lateness in flowshops with setup and removal times separatedJournal of the Operational Research Society, 1998
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic BreakdownsJournal of the Operational Research Society, 1995
- Two-machine group scheduling problem with blocking and anticipatory setupsEuropean Journal of Operational Research, 1993
- Job lateness in a two-machine flowshop with setup times separatedComputers & Operations Research, 1991
- Solvable Cases of the No-wait Flow-shop Scheduling ProblemJournal of the Operational Research Society, 1991
- Sequency on two and three machines with setup, processing and removal times separatedInternational Journal of Production Research, 1983
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion timesNaval Research Logistics Quarterly, 1982
- Optimal Two-Stage Production Scheduling with Setup Times SeparatedA I I E Transactions, 1979