Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots

DOI10.1051/ro/1990240403151zbMath0712.90037OpenAlexW2461555207MaRDI QIDQ3197611

Wenxue Han, Pierre Dejax

Publication date: 1990

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

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

zbMATH Keywords

makespanheuristic algorithmflow-shop schedulingidentification of the bottleneck machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Two branch and bound algorithms for the permutation flow shop problem