Three-machine open shop with a bottleneck machine revisited

DOI10.1007/S10951-020-00652-9zbMath1479.90086OpenAlexW3095608774MaRDI QIDQ2061137

Inna G. Drobouchevitch

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-020-00652-9

zbMATH Keywords

schedulingopen shopminimum makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Makespan minimization in open shops: A polynomial time approximation scheme
• A polynomial algorithm for the three-machine open shop with a bottleneck machine
• A cyclical search for the two machine flow shop and open shop to minimise finishing time
• Open-shop dense schedules: properties and worst-case performance ratio
• Open Shop Scheduling to Minimize Finish Time
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Short Shop Schedules
• How good is a dense shop schedule?

This page was built for publication: Three-machine open shop with a bottleneck machine revisited