A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime

DOI10.1111/j.1475-3995.2004.00461.xzbMath1162.90470OpenAlexW2008570019MaRDI QIDQ3158872

Ali Allahverdi, Yeh, Wei-Chang

Publication date: 31 January 2005

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2004.00461.x

zbMATH Keywords

heuristicsflowtimemakespanflowshopbicriteriadominance relation

Mathematics Subject Classification ID

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

Related Items

A bicriteria flowshop scheduling with a learning effect

Cites Work

• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• The two-machine total completion time flow shop problem
• A bicriteria two-machine permutation flowshop problem
• Heuristics for scheduling in flowshop with multiple objectives
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• No-wait flowshops with bicriteria of makespan and total completion time