Minimizing Mean Completion Time for Special Flowshop Problems

DOI10.1080/02331939708844300zbMath0871.90040OpenAlexW2026710330MaRDI QIDQ4341060

P. C. Bagga, Ambika Bhambani

Publication date: 16 June 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844300

zbMATH Keywords

sequencingelapsed timegeneral flowshop problemmean completion time of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Flowshop scheduling with dominant machines
• Optimal two- and three-stage production schedules with setup times included
• Permutation flow-shop theory revisited
• An improved branch and bound procedure forn ×m flow shop problems
• Optimal schedules for special structure flowshops
• Special cases of the flow-shop problem
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Branch-and-Bound Methods: A Survey

This page was built for publication: Minimizing Mean Completion Time for Special Flowshop Problems