Permutation flow shops with exact time lags to minimise maximum lateness

DOI10.1080/00207540802320164zbMath1198.90180OpenAlexW2022431436MaRDI QIDQ3055251

Ali Allahverdi, Marie-Claude Portmann, Julien Fondrevelle, Ammar Oulamara

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802320164

zbMATH Keywords

schedulingflow shop

Mathematics Subject Classification ID

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

Related Items

The two-machine no-wait general and proportionate open shop makespan problem ⋮ A survey of scheduling problems with setup times or costs ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies