Optimal scheduling of a two-stage hybrid flow shop

DOI10.1007/s00186-006-0066-4zbMath1131.90023OpenAlexW2035854353MaRDI QIDQ857819

Mohamed Haouari, Anis Gharbi, Lotfi Hidri

Publication date: 5 January 2007

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0066-4

zbMATH Keywords

Branch-and-bound methodDeterministic schedulingHybrid flow shop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ Flexible job shop scheduling with blockages ⋮ The hybrid flow shop scheduling problem ⋮ Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach ⋮ Optimal solutions for a dock assignment problem with trailer transportation

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Lower bounds for scheduling on identical parallel machines with heads and tails
• Parallel machines scheduling with nonsimultaneous machine available time
• Branch and bound algorithm for the flow shop with multiple processors
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Branch and bound crossed with GA to solve hybrid flowshops
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Heuristic algorithms for the two-stage hybrid flowshop problem
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• Minimizing makespan on parallel machines subject to release dates and delivery times
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Optimal parallel machines scheduling with availability constraints
• A note on parallel machine scheduling with non-simultaneous machine available time
• Scheduling with limited machine availability
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Exact Method for Solving the Multi-Processor Flow-Shop

This page was built for publication: Optimal scheduling of a two-stage hybrid flow shop