How good is a dense shop schedule?

DOI10.1007/BF02669692zbMath0964.90017MaRDI QIDQ5931907

Bo Chen, Wen-Ci Yu

Publication date: 6 May 2001

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

boundsdense schedulesjob-shop schedulesmakespan of dense flow-shopmaximum deviationshop schedulesworst-case performance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The Open Shop Scheduling Problem ⋮ Optimal results and numerical simulations for flow shop scheduling problems ⋮ Open-shop dense schedules: properties and worst-case performance ratio ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Three-machine open shop with a bottleneck machine revisited ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling

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

This page was built for publication: How good is a dense shop schedule?