Permutation vs. non-permutation flow shop schedules

DOI10.1016/0167-6377(91)90014-GzbMath0742.90045MaRDI QIDQ1180831

David P. Williamson, David B. Shmoys, Chris N. Potts

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsmaximum completion timeflow shop schedulingpermutation schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Flow shop scheduling problem with conflict graphs ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Analysis of heuristics for the UET two-machine flow shop problem with time delays ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ Permutation schedules for a two-machine flow shop with storage ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Shop scheduling problems with pliable jobs ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permutation vs. non-permutation flow shop schedules