Scheduling permutation flowshops with initial availability constraint : analysis of solutions and constructive heuristics
Year of publication: |
2009
|
---|---|
Authors: | Perez-Gonzalez, Paz ; Framinan, Jose M. |
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. 36.2009, 10, p. 2866-2876
|
Subject: | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time |
-
Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic
M'Hallah, Rym, (2012)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
-
Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families
Cakici, Eray, (2013)
- More ...
-
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)
-
On heuristic solutions for the stochastic flowshop scheduling problem
Framinan, Jose M., (2015)
- More ...