Exact resolution of the two-stage hybrid flow shop with dedicated machines

DOI10.1007/S11590-014-0741-YzbMath1309.90025OpenAlexW2017539352MaRDI QIDQ479265

Sonia Hajri-Gabouj, Hatem Hadda, Najoua Dridi

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0741-y

zbMATH Keywords

schedulingbranch and boundhybrid flow shopdedicated machineselimination rule

Mathematics Subject Classification ID

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

Related Items (3)

Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ On the two-stage hybrid flow shop with dedicated machines ⋮ On the optimality conditions of the two-machine flow shop problem

Cites Work

• A note on ``A heuristic method for two-stage hybrid flow shop with dedicated machines
• A heuristic method for two-stage hybrid flow shop with dedicated machines
• Two branch and bound algorithms for the permutation flow shop problem
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
• Two-stage flowshop scheduling with a common second-stage machine
• A note on the two-stage hybrid flow shop problem with dedicated machines
• Benchmarks for basic scheduling problems
• Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

This page was built for publication: Exact resolution of the two-stage hybrid flow shop with dedicated machines