Flow shop scheduling problem with conflict graphs
Year of publication: |
February 2018
|
---|---|
Authors: | Tellache, Nour El Houda ; Boudhar, Mourad |
Published in: |
Annals of operations research ; volume 261, numbers 1/2 (February 2018). - New York, NY, USA : Springer. - 2018, p. 338-363
|
Subject: | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Thevenin, Simon, (2017)
-
Single-machine scheduling with deteriorating jobs under a series-parallel graph contraint
Wang, Ji-Bo, (2008)
-
Accelerating the calculation of makespan used in scheduling improvement heuristics
Madraki, Golshan, (2021)
- More ...
-
Two-machine flow shop problem with unit-time operations and conflict graph
Tellache, Nour El Houda, (2017)
-
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
Tellache, Nour El Houda, (2023)
-
Preemptive scheduling with transportation delays between machines
Badaoui, Ryma Zineb, (2020)
- More ...