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

DOI10.1051/ro:2000103zbMath0963.90027MaRDI 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 problems; inputs and selection; multi-processor flow-shop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Bounding strategies for the hybrid flow shop scheduling problem, Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis, Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, Optimal scheduling of a two-stage hybrid flow shop, A taxonomy of flexible flow line scheduling procedures, List scheduling in a parallel machine environment with precedence constraints and setup times, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, Optimal parallel machines scheduling with availability constraints, The hybrid flow shop scheduling problem, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails