Polynomial time algorithms for the UET permutation flowshop problem with time delays

DOI10.1016/j.cor.2006.03.018zbMath1141.90020OpenAlexW2161560287MaRDI QIDQ2384903

Alix Munier Kordon, Djamal Rebaine

Publication date: 10 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.018

zbMATH Keywords

schedulingtime delaysComplexitymakespanpermutation flowshop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints ⋮ Analysis of heuristics for the UET two-machine flow shop problem with time delays ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Flowshop and Jobshop Schedules: Complexity and Approximation

This page was built for publication: Polynomial time algorithms for the UET permutation flowshop problem with time delays