Size-reduction heuristics for the unrelated parallel machines scheduling problem
Year of publication: |
2011
|
---|---|
Authors: | Fanjul-Peyro, Luis ; Ruiz, Rubén |
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. 38.2011, 1, p. 301-309
|
Subject: | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
-
Ozturk, Onur, (2017)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
- More ...
-
Iterated greedy local search methods for unrelated parallel machine scheduling
Fanjul-Peyro, Luis, (2010)
-
Iterated greedy local search methods for unrelated parallel machine scheduling
Fanjul-Peyro, Luis, (2010)
-
Iterated greedy local search methods for unrelated parallel machine scheduling
Fanjul-Peyro, Luis, (2010)
- More ...