An open shop scheduling problem with a non-bottleneck machine

DOI10.1016/S0167-6377(97)00030-8zbMath0885.90061OpenAlexW1979848432MaRDI QIDQ1371949

Leslie A. Hall, Vitaly A. Strusevich

Publication date: 6 November 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00030-8

zbMATH Keywords

approximationmakespanworst-case analysismaximum completion timefully polynomial approximation schemetwo-machine non-preemptive open shop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE ⋮ A heuristic for the two-machine open-shop scheduling problem with transportation times ⋮ Two-stage open shop scheduling with a bottleneck machine ⋮ Scheduling parallel dedicated machines under a single non-shared resource

Cites Work

• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item

This page was built for publication: An open shop scheduling problem with a non-bottleneck machine