An Exact Method for Solving the Multi-Processor Flow-Shop

DOI10.1051/ro:2000103zbMath0963.90027OpenAlexW2153895727MaRDI QIDQ4497882

Jacques Carlier, Emmanuel Néron

Publication date: 24 August 2000

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

Full work available at URL: http://www.numdam.org/item?id=RO_2000__34_1_1_0/

zbMATH Keywords

branch and bound method\(m\)-machine problemsinputs and selectionmulti-processor flow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Metaheuristics in modeling humanoid robots: a literature review ⋮ An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ Bounding strategies for the hybrid flow shop scheduling problem ⋮ A review of exact solution methods for the non-preemptive multiprocessor flowshop problem ⋮ The hybrid flow shop scheduling problem ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ List scheduling in a parallel machine environment with precedence constraints and setup times ⋮ Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis