A note on makespan minimization in proportionate flow shops

DOI10.1016/j.ipl.2010.10.016zbMath1260.90088OpenAlexW2048896639MaRDI QIDQ1944041

Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.016

zbMATH Keywords

combinatorial problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

Cites Work

• Unnamed Item
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Time-dependent scheduling
• A note on the proportionate flow shop with a bottleneck machine
• Minimizing total weighted completion time in a proportionate flow shop
• The three-machine proportionate flow shop problem with unequal machine speeds
• A survey of scheduling with controllable processing times
• A state-of-the-art review on scheduling with learning effects
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Focused Scheduling in Proportionate Flowshops
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• The Complexity of Flowshop and Jobshop Scheduling
• Flowshop-scheduling problems with makespan criterion: a review

This page was built for publication: A note on makespan minimization in proportionate flow shops