Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
Year of publication: |
January 2019
|
---|---|
Authors: | Fanjul-Peyro, Luis ; Ruiz, Rubén ; Perea, Federico |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 101.2019, p. 173-182
|
Subject: | Parallel machine | Scheduling | Sequence dependent setup times | Makespan | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Produktionssteuerung | Production control | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound |
-
Bi-objective parallel machine scheduling with additional resources during setups
Yepes-Borrero, Juan C., (2021)
-
Walter, Rico, (2017)
-
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
Gu, Manzhan, (2018)
- More ...
-
Fanjul-Peyro, Luis, (2017)
-
Iterated greedy local search methods for unrelated parallel machine scheduling
Fanjul-Peyro, Luis, (2010)
-
Size-reduction heuristics for the unrelated parallel machines scheduling problem
Fanjul-Peyro, Luis, (2011)
- More ...