A three-machine permutation flow-shop problem with minimum makespan on the second machine

DOI10.1057/palgrave.jors.2602014zbMath1086.90030OpenAlexW2034757990MaRDI QIDQ3378829

Shuzo Yanai, Tetsuya Fujie

Publication date: 4 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602014

zbMATH Keywords

branch-and-bound algorithmhierarchical criteriamulticriteria schedulingflow-shop scheduling

Mathematics Subject Classification ID

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

This page was built for publication: A three-machine permutation flow-shop problem with minimum makespan on the second machine