A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups

DOI10.1016/S0167-6377(00)00019-5zbMath0971.90032MaRDI QIDQ1577472

Chris N. Potts, Jeffrey B. Sidney, Chelliah Skriskandarajah

Publication date: 22 November 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmworst-case analysisdeterministic schedulingsetupperformance boundsno-wait flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Some local search algorithms for no-wait flow-shop problem with makespan criterion, A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, A survey of scheduling problems with setup times or costs, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, A survey of scheduling problems with no-wait in process, A review of TSP based approaches for flowshop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• No-wait shop scheduling: Computational complexity and approximate algorithms
• Two-machine group scheduling problem with blocking and anticipatory setups
• Two-stage no-wait scheduling models with setup and removal times separated
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process