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

DOI10.1057/palgrave.jors.2602598zbMath1163.90802OpenAlexW2047622520MaRDI QIDQ3636717

Yeong-Dae Kim, Byung-Jun Joo

Publication date: 29 June 2009

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.2602598

zbMATH Keywords

schedulingmakespantwo-machine flowshoplimited waiting time

Mathematics Subject Classification ID

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

Related Items (7)

Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals

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