Sequencing a hybrid two-stage flowshop with dedicated machines

DOI10.1080/00207540210159536zbMath1064.90545OpenAlexW1988725581MaRDI QIDQ4706331

Salah E. Elmaghraby, Abdelhakim Artiba, Fouad Riane

Publication date: 13 October 2003

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540210159536

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, A heuristic method for two-stage hybrid flow shop with dedicated machines, The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Minimizing total completion time in two-stage hybrid flow shop with dedicated machines, A two-stage flow shop scheduling problem with transportation considerations, The hybrid flow shop scheduling problem

Cites Work

• Branch and bound algorithm for the flow shop with multiple processors
• Minimizing makespan in hybrid flowshops
• Optimal two- and three-stage production schedules with setup times included
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• The Complexity of Flowshop and Jobshop Scheduling
• A flowshop scheduling problem with two operations per job
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem