A concise survey of efficiently solvable special cases of the permutation flow-shop problem

DOI10.1051/ro/1983170201051zbMath0523.90054OpenAlexW2586270237MaRDI QIDQ3674391

Alexander H. G. Rinnooy Kan, Clyde l. Monma

Publication date: 1983

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104828

zbMATH Keywords

survey precedence constraints bottleneck machines permutation flow-shop problem lag times associated directed group restrictions on job processing times weight of a critical path

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (27)

Lot streaming in three-stage production processes ⋮ The interface of buffer design and cyclic scheduling decisions in deterministic flow lines ⋮ A linear time approximation algorithm for movement minimization in conveyor flow shop processing ⋮ Flowshop scheduling with dominant machines ⋮ Lot streaming in the two-machine flow shop with setup times ⋮ On the recognition of permuted bottleneck Monge matrices ⋮ On the role of bottleneck Monge matrices in combinatorial optimization ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time ⋮ Flow shop scheduling problems with decreasing linear deterioration under dominant machines ⋮ Approximation methods for discrete lot streaming in flow shops ⋮ Open shop scheduling with maximal machines ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Perspectives of Monge properties in optimization ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ No-wait or no-idle permutation flowshop scheduling with dominating machines ⋮ Complexity results for flow shop problems with synchronous movement ⋮ Two branch and bound algorithms for the permutation flow shop problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Lot streaming with detached setups in three-machine flow shops ⋮ On three-machine flow shops with random job processing times ⋮ Non-bottleneck machines in three-machine flow shops ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures ⋮ Nonpreemptive flowshop scheduling with machine dominance ⋮ A combination of flow shop scheduling and the shortest path problem

This page was built for publication: A concise survey of efficiently solvable special cases of the permutation flow-shop problem