A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
Year of publication: |
2019
|
---|---|
Authors: | Meignan, David ; Knust, Sigrid |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 279.2019, 2 (1.12.), p. 320-334
|
Subject: | Scheduling | Reoptimization | Metaheuristic | Neutrality-based iterated local search | Interactive optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
Bamoumen, Meryem, (2023)
-
Woo, Young-Bin, (2018)
-
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Schönberger, Jörn, (2015)
- More ...
-
Meignan, David, (2010)
-
Meignan, David, (2010)
-
On Circular 2-Factorizations of the Complete Tripartite Graph
Briskorn, Dirk, (2008)
- More ...