Flow Shop Problems with Time Lags

DOI10.1287/mnsc.29.4.477zbMath0513.90036OpenAlexW1990278545MaRDI QIDQ3659509

Wlodzimierz Szwarc

Publication date: 1983

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.29.4.477

zbMATH Keywords

approximate solutionstime lagsextension of the classical flow shop problemlower completion time bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ The flow shop problem with time lags and separated setup times ⋮ An approximate solution of the flow-shop problem with sequence dependent setup times ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Time lag size in multiple operations flow shop scheduling heuristics ⋮ Clustered flow shop models ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints

This page was built for publication: Flow Shop Problems with Time Lags