A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints

DOI10.1057/PALGRAVE.JORS.2602598MaRDI QIDQ3636717zbMATHOpenAlexFDO

Authors Byung-Jun Joo, Yeong-Dae Kim

Publication date 29 June 2009

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

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

zbMATH Keywords

schedulingmakespanlimited waiting timetwo-machine flowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• Two-machine flowshop scheduling with a secondary criterion
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm

Cited in

(12)

• Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
• Three-machine flow shop scheduling with overlapping waiting time constraints
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Two-stage hybrid flow shop scheduling with dynamic job arrivals
• Model formulations for the machine scheduling problem with limited waiting time constraints
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• scientific article; zbMATH DE number 6673363 (Why is no real title available?)
• A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times

This page was built for publication: A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints

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