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

DOI10.1051/RO:2000103MaRDI QIDQ4497882zbMATH OpenOpenAlexFDO

Authors Jacques Carlier, E. 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/, https://eudml.org/doc/197780

zbMATH Keywords

\(m\)-machine problemsbranch and bound methodinputs and selectionmulti-processor flow-shop

Mathematics Subject Classification ID

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

Recommendations

• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Branch and bound algorithm for the flow shop with multiple processors
• Minimizing maximum lateness in a flow shop subject to release dates
• A multi-stage parallel-processor flowshop problem with minimum flowtime

Cited in

(23)

• A multi-stage parallel-processor flowshop problem with minimum flowtime
• 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
• Metaheuristics in modeling humanoid robots: a literature review
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
• The hybrid flow shop scheduling problem
• Metaheuristic algorithms for the hybrid flowshop scheduling problem
• Automatic algorithm design for hybrid flowshop scheduling problems
• 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
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
• scientific article; zbMATH DE number 3916005 (Why is no real title available?)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
• Bounding strategies for the hybrid flow shop scheduling problem
• A systematic review of multi-objective hybrid flow shop scheduling
• A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths
• A decision-supported bi-objective genetic algorithm for hybrid flow shop scheduling with learning effects
• Branch and bound algorithm for the flow shop with multiple processors
• 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

This page was built for publication: An Exact Method for Solving the Multi-Processor Flow-Shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497882)