Heuristic algorithms for scheduling intrees on m machines with non-availability constraints
| Year of publication: |
2021
|
|---|---|
| Authors: | Abdellafou, Khaoula Ben ; Hadda, Hatem ; Korbaa, Ouajdi |
| Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 21.2021, 1, p. 55-71
|
| Subject: | Scheduling | Non-availability | Heuristic | Tabu search | Makespan | Intree | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Flow shop batching and scheduling with sequence-dependent setup times
Shen, Liji, (2014)
-
Massabo, Ivar, (2016)
-
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique, (2020)
- More ...
-
An improved algorithm for the two machine flow shop problem with several availability contraints
Hadda, Hatem, (2010)
-
Hadda, Hatem, (2009)
-
Approximation results for the two-machine job shop under limited machine availability
Hadda, Hatem, (2017)
- More ...