MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
Year of publication: |
2012
|
---|---|
Authors: | Kim, Mi-yi ; Yi, Yŏng-hun |
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. 39.2012, 11, p. 2457-2468
|
Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Janiak, Adam, (2001)
-
Rakrouki, Mohamed Ali, (2012)
-
Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E., (2013)
- More ...
-
Stochastic frontier models in sports economics
Yi, Yŏng-hun, (2014)
-
Lee, Yoon Ho, (2013)
-
Competitive balance : time series lessons from the English Premier League
Yi, Yŏng-hun, (2012)
- More ...