An improved branch and bound procedure for scheduling a flow line manufacturing cell

DOI10.1080/00207540500185216zbMath1095.90045OpenAlexW1966953613MaRDI QIDQ5478802

Jeffrey E. Schaller

Publication date: 13 July 2006

Published in: International Journal of Production Research (Search for Journal in Brave)

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

zbMATH Keywords

schedulingbranch-and-boundsequencingflowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

A comprehensive review of flowshop group scheduling literature

Cites Work

• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• An Evaluation of Flow Shop Sequencing Heuristics
• A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: An improved branch and bound procedure for scheduling a flow line manufacturing cell