Non-bottleneck machines in three-machine flow shops
From MaRDI portal
Publication:1585915
DOI<209::AID-JOS43>3.0.CO;2-W 10.1002/1099-1425(200007/08)3:4<209::AID-JOS43>3.0.CO;2-WzbMath0962.90017MaRDI QIDQ1585915
Publication date: 3 January 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Johnson's rule, composite jobs and the relocation problem
Cites Work
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Flow-shops with a dominant machine
- Flowshop scheduling with dominant machines
- Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- Sequencing with Series-Parallel Precedence Constraints
- Counterexamples to optimal permutation schedules for certain flow shop problems
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- A special case of the 3 ×n flow shop problem
- Technical Note—Three-Stage Flow-Shops with Recessive Second Stage
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Shop Problems With Two Machines and Time Lags
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Mathematical aspects of the 3 × n job-shop sequencing problem
- A note on a paper by W. Szwarc
- A Note on Heuristics of Flow-Shop Scheduling
This page was built for publication: Non-bottleneck machines in three-machine flow shops
