Two-machine flow shop scheduling problems with minimal and maximal delays

DOI10.1007/s10288-005-0069-7zbMath1125.90350OpenAlexW2081841173MaRDI QIDQ862809

Christophe Lenté, Jean-Louis Bouquard

Publication date: 24 January 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-005-0069-7

zbMATH Keywords

Flow shopbranch-and-bound procedureMax-Plus algebra

Mathematics Subject Classification ID

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

Related Items (9)

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ An algebraic expression of the number partitioning problem ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS

This page was built for publication: Two-machine flow shop scheduling problems with minimal and maximal delays