Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
Year of publication: |
November 2016
|
---|---|
Authors: | Beaton, Clifford ; Diallo, Claver ; Gunn, Eldon |
Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 121260-6. - Vol. 54.2016, 4, p. 305-316
|
Subject: | Parallel machines | availability constraints | makespan | scheduling | semi-resumable jobs | non-resumable jobs | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Produktionssteuerung | Production control | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Ozturk, Onur, (2017)
-
Lopez-Esteve, Axel, (2023)
- More ...
-
Improving Throughput of a Coal Transport System with the Aid of Three Simple Models
Allen, Glenn, (1993)
-
Some Perspectives on Strategic Forest Management Models and the Forest Products Supply Chain
Gunn, Eldon, (2009)
-
Some perspectives on strategic forest management models and the forest products supply chain
Gunn, Eldon, (2009)
- More ...