Non-bottleneck machines in three-machine flow shops

DOI10.1002/1099-1425(200007/08)3:4%3C209::AID-JOS43%3E3.0.CO;2-WMaRDI QIDQ1585915zbMATH OpenFDO

Authors Jerzy Kamburowski

Publication date 3 January 2001

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

zbMATH Keywords

makespanworst-case analysissequencingJohnson's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Three-machine open shop with a bottleneck machine revisited
• scientific article; zbMATH DE number 3843477
• An open shop scheduling problem with a non-bottleneck machine
• A polynomial algorithm for the three-machine open shop with a bottleneck machine
• scientific article; zbMATH DE number 3980892

Cites work

• A New Heuristic for Three-Machine Flow Shop Scheduling
• A Note on Heuristics of Flow-Shop Scheduling
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• A note on a paper by W. Szwarc
• A special case of the 3 ×n flow shop problem
• Counterexamples to optimal permutation schedules for certain flow shop problems
• Discussion: sequencing \(n\) jobs on two machines with arbitrary time lags
• Flow-shops with a dominant machine
• Flowshop scheduling with dominant machines
• Mathematical aspects of the 3 × n job-shop sequencing problem
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing with Series-Parallel Precedence Constraints
• Shop Problems With Two Machines and Time Lags
• Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
• Technical Note—Three-Stage Flow-Shops with Recessive Second Stage
• The Complexity of Flowshop and Jobshop Scheduling
• The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
• Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling

Cited in

(3)

• Johnson's rule, composite jobs and the relocation problem
• Three-machine open shop with a bottleneck machine revisited
• An improved NEH heuristic to minimize makespan in permutation flow shops

This page was built for publication: Non-bottleneck machines in three-machine flow shops

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