Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems

DOI10.1016/0377-2217(85)90317-0zbMath0559.90039OpenAlexW2074041588MaRDI QIDQ2265944

Yih-Bor Wu, J. George Shanthikumar

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90317-0

zbMATH Keywords

branch and boundflow shoppermutation schedulesdecomposition approachesComplete decompositionheuristic estimateIterative decompositionM-machine flow problemPartial decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ A decomposition scheduling method for operating flexible manufacturing systems ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ Heuristics for permutation flow shop scheduling with batch setup times ⋮ Heuristic methods and applications: A categorized survey ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Cites Work

• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM
• A Comparative Study of Flow-Shop Algorithms
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• Elimination methods in them ×n sequencing problem