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 |
-
Lee, Jun-ho, (2021)
-
Scheduling two identical parallel machines with preparation constraints
Labbi, Wafaa, (2017)
-
Chain-reentrant shop with an exact time lag : new results
Amrouche, Karim, (2017)
- 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 ...