A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
From MaRDI portal
Publication:1819236
DOI10.1016/S0305-0548(98)00106-3zbMath0967.90052MaRDI QIDQ1819236
Publication date: 3 September 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime, No-wait flowshops with bicriteria of makespan and maximum lateness., A bicriteria flowshop scheduling with a learning effect, A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times, Counting and enumeration complexity with application to multicriteria scheduling, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
