A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
From MaRDI portal
Publication:5443372
DOI10.1007/978-3-540-77918-6_5zbMath1130.90020MaRDI QIDQ5443372
Publication date: 20 February 2008
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_5
68W40: Analysis of algorithms
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
Related Items
Cites Work
- Unnamed Item
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Approximation algorithms for UET scheduling problems with exact delays
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Shop Problems With Two Machines and Time Lags
- Approximation Algorithms for Scheduling Problems with Exact Delays