Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

DOI10.1051/RO/2009024zbMath1173.90402OpenAlexW2167813355MaRDI QIDQ3644816

Sonia Hajri-Gabouj, Hatem Hadda, Najoua Dridi

Publication date: 12 November 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105444

zbMATH Keywords

heuristicsschedulinglower boundshybrid flow shopdedicated machinespolynomial cases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (6)

A note on ``A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ On the two-stage hybrid flow shop with dedicated machines ⋮ A note on the two-stage hybrid flow shop problem with dedicated machines ⋮ Exact resolution of the two-stage hybrid flow shop with dedicated machines ⋮ On the optimality conditions of the two-machine flow shop problem ⋮ Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

Cites Work

• 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
• Optimal two- and three-stage production schedules with setup times included
• Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Optimal scheduling of the 3-machine assembly-type flow shop
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: Méthode heuristique pour le problème de flow shop hybride avec machines dédiées