New approximate algorithms for the customer order scheduling problem with total completion time objective
Year of publication: |
February
|
---|---|
Authors: | Framian, Jose M. ; Perez-Gonzalez, Paz |
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. 78.2017, p. 181-192
|
Subject: | Order scheduling | Completion times | Heuristics | Scheduling-Verfahren | Scheduling problem | Heuristik | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory |
-
Scheduling to maximise worker satisfaction and on-time orders
Ruiz-Torres, Alex J., (2015)
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Ozturk, Onur, (2012)
- More ...
-
Perez-Gonzalez, Paz, (2014)
-
Perez-Gonzalez, Paz, (2009)
-
Perez-Gonzalez, Paz, (2014)
- More ...