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 | Heuristik | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Terminplanung | Time scheduling |
-
Ma, Ran, (2014)
-
Minimizing the total completion time of an urban delivery problem with uncertain assembly time
Liu, Bingbing, (2019)
-
Real-time scheduling to minimize machine busy times
Khandekar, Rohit, (2015)
- More ...
-
Perez-Gonzalez, Paz, (2009)
-
Setting a common due date in a constrained flowshop : a variable neighbourhood search approach
Perez-Gonzalez, Paz, (2010)
-
Assessing scheduling policies in a permutation flowshop with common due dates
Perez-Gonzalez, Paz, (2015)
- More ...