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 |
-
Two parallel identical machines scheduling to minimise the maximum inter-completion time
Zheng, Feifeng, (2020)
-
Ozturk, Onur, (2017)
-
Lee, Jun-ho, (2021)
- More ...
-
Some perspectives on strategic forest management models and the forest products supply chain
Gunn, Eldon, (2009)
-
An introduction to industrial forestry from a location perspective
Gunn, Eldon, (2015)
-
Operations Research challenges in forestry : 33 open problems
Rönnqvist, Mikael, (2015)
- More ...