Analysis of heuristics for the UET two-machine flow shop problem with time delays

DOI10.1016/j.cor.2007.02.015zbMath1135.90016OpenAlexW2162576986MaRDI QIDQ2482380

Djamal Rebaine, V. J. Rayward-Smith

Publication date: 16 April 2008

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

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

zbMATH Keywords

Flow shopMakespanWorst-case analysisAverage-Case analysisChange-over times

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

On-line two-machine job shop scheduling with time lags

Cites Work

• Permutation vs. non-permutation flow shop schedules
• Polynomial time algorithms for the UET permutation flowshop problem with time delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• 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
• UET flow shop scheduling with delays
• Unnamed Item
• Unnamed Item