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

DOI10.1051/RO:2000103zbMATH Open0963.90027OpenAlexW2153895727MaRDI QIDQ4497882FDOQ4497882

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/

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

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)

Cited In (20)

• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• Automatic algorithm design for hybrid flowshop scheduling problems
• Metaheuristics in modeling humanoid robots: a literature review
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• Bounding strategies for the hybrid flow shop scheduling problem
• Optimal parallel machines scheduling with availability constraints
• A taxonomy of flexible flow line scheduling procedures
• The hybrid flow shop scheduling problem
• List scheduling in a parallel machine environment with precedence constraints and setup times
• Optimal scheduling of a two-stage hybrid flow shop
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Title not available (Why is that?)
• A systematic review of multi-objective hybrid flow shop scheduling
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• 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
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Metaheuristic algorithms for the hybrid flowshop scheduling problem

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)