A Combinatorial Benders' decomposition for the lock scheduling problem
| Year of publication: |
2015
|
|---|---|
| Authors: | Verstichel, J. ; Kinable, J. ; De Causmaecker, Patrick ; Vanden Berghe, Greet |
| 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. 54.2015, p. 117-128
|
| Subject: | Lock Scheduling Problem | Combinatorial Benders' decomposition | Scheduling-Verfahren | Scheduling problem | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
Caselli, Giulia, (2024)
-
The generalized lock scheduling problem : an exact approach
Verstichel, Jannes, (2014)
-
Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines
Tadumadze, Giorgi, (2020)
- More ...
-
A learning-based optimization approach to multi-project scheduling
Wauters, Tony, (2015)
-
An improved best-fit heuristic for the orthogonal strip packing problem
Verstichel, Jannes, (2013)
-
A new hyper-heuristic as a general problem solver : an implementation in HyFlex
Misir, Mustafa, (2013)
- More ...