Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
Year of publication: |
2015
|
---|---|
Authors: | Sels, Veronique ; Coelho, José ; Dias, António Manuel ; Vanhoucke, Mario |
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. 53.2015, p. 107-117
|
Subject: | Machine scheduling | SAT | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Wu, Lingxiao, (2018)
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
-
Ozturk, Onur, (2017)
- More ...
-
Truncated branch-and-bound guided meta-heuristics for the unrelated parallel machine
Sels, Veronique, (2011)
-
A hybrid single and dual population search procedure for the job shop scheduling problem
Sels, Veronique, (2011)
-
Sels, Veronique, (2012)
- More ...