Approximation algorithms for two-machine flow shop scheduling with batch setup times
From MaRDI portal
Publication:1290646
DOI10.1007/BF01585875zbMath0920.90070MaRDI QIDQ1290646
Chris N. Potts, Bo Chen, Vitaly A. Strusevich
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
approximation algorithm; makespan; worst-case performance; NP-hard; heuristic algorithms; two-machine flow shop; independent jobs; batch setup time
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Group technology approach to the open shop scheduling problem with batch setup times, Scheduling with batching: A review
Cites Work
- Two-machine shop scheduling problems with batch processing
- Optimal two- and three-stage production schedules with setup times included
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Open Shop Scheduling to Minimize Finish Time
- On the Complexity of Scheduling with Batch Setup Times
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
