How good is a dense shop schedule?
From MaRDI portal
Publication:5931907
DOI10.1007/BF02669692zbMath0964.90017MaRDI QIDQ5931907
Publication date: 6 May 2001
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
bounds; dense schedules; job-shop schedules; makespan of dense flow-shop; maximum deviation; shop schedules; worst-case performance
90B35: Deterministic scheduling theory in operations research
Related Items
Polynomial time approximation algorithms for proportionate open‐shop scheduling, Optimal results and numerical simulations for flow shop scheduling problems, Open-shop dense schedules: properties and worst-case performance ratio, Unnamed Item
Cites Work
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- Short Shop Schedules
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item