Flow-shop scheduling for three serial stations with the last two duplicate

DOI10.1016/j.cor.2003.08.010zbMath1061.90044OpenAlexW2079033567MaRDI QIDQ1886869

Bandar Al-Harbi, Ahmet Bolat, Ibrahim Al-Harkan

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.010

zbMATH Keywords

Genetic algorithmSchedulingBranch and boundSerial and duplicate stations

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The hybrid flow shop scheduling problem ⋮ Order acceptance using genetic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two branch and bound algorithms for the permutation flow shop problem
• Sequencing jobs for an automated manufacturing module with buffer
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Algorithms for real-time scheduling of jobs on mixed model assembly lines
• A genetic algorithm for flowshop sequencing
• Total flowtime in no-wait flowshops with separated setup times.
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Flowshop scheduling with limited temporary storage
• The Complexity of Flowshop and Jobshop Scheduling
• A New Heuristic for Three-Machine Flow Shop Scheduling
• Scheduling duplicate serial stations in transfer lines
• Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers