Decomposition methods for the parallel machine scheduling problem with setups
Year of publication: |
2016
|
---|---|
Authors: | Tran, Tony T. ; Araujo, Arthur ; Beck, J. Christopher |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 1, p. 83-95
|
Subject: | unrelated parallel machines | minimizing makespan | sequence-dependent setup times | decomposition model | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Produktionsplanung | Production planning | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
Arnaout, Jean-Paul, (2020)
-
A note on scheduling on uniform parallel machines with unavailability constraints
Xu, Dehua, (2021)
-
A two-stage three-machine assembly scheduling problem with a position-based learning effect
Wu, Chin-Chia, (2018)
- More ...
-
Multi-stage resource-aware scheduling for data centers with heterogeneous servers
Tran, Tony T., (2018)
-
Constraint programming, artificial intelligence, and operations research
Beck, J. Christopher, (2009)
-
Fazel-Zarandi, Mohammad M., (2013)
- More ...