An improved branch and bound procedure forn ×m flow shop problems

DOI10.1002/NAV.3800220412zbMATH Open0322.90030OpenAlexW2033786831MaRDI QIDQ4085478FDOQ4085478

Authors: Abdul Wadood Khan, S. S. Panwalkar 

Publication date: 1975

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800220412

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (3)

• Minimizing Mean Completion Time for Special Flowshop Problems
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• Flowshop/no-idle scheduling to minimize total elapsed time

This page was built for publication: An improved branch and bound procedure forn ×m flow shop problems

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