An open shop scheduling problem with a non-bottleneck machine

DOI10.1016/S0167-6377(97)00030-8MaRDI QIDQ1371949zbMATH OpenOpenAlexFDO

Authors V. A. Strusevich, Leslie A. Hall

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 analysisfully polynomial approximation schememaximum completion timetwo-machine non-preemptive open shop

Mathematics Subject Classification ID

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

Recommendations

• The open shop scheduling problem with a given sequence of jobs on one machine
• Two-stage open shop scheduling with a bottleneck machine
• Nonpreemptive open shop with restricted processing times
• A polynomial algorithm for the three-machine open shop with a bottleneck machine

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Open Shop Scheduling to Minimize Finish Time

Cited in

(11)

• scientific article; zbMATH DE number 4131935 (Why is no real title available?)
• Scheduling parallel dedicated machines under a single non-shared resource
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• A heuristic for the two-machine open-shop scheduling problem with transportation times
• Non-bottleneck machines in three-machine flow shops
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• A polynomial algorithm for the three-machine open shop with a bottleneck machine
• Three-machine open shop with a bottleneck machine revisited
• Scheduling proportionally deteriorating jobs in two-machine open shop with a non-bottleneck machine
• Two-stage open shop scheduling with a bottleneck machine

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371949)