Solving variants of the job shop scheduling problem through conflict-directed search
Year of publication: |
2015
|
---|---|
Authors: | Grimes, Diarmuid ; Hebrard, Emmanuel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 2, p. 268-284
|
Subject: | scheduling | combinatorial optimization | disjunctive/unary resource | constraint programming | adaptive search heuristics | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
An adaptive multistart tabu search approach to solve the maximum clique problem
Wu, Qinghua, (2013)
-
Scatter search for an uncapacitated p-hub median problem
MartÃ, Rafael, (2015)
-
Kulich, Miroslav, (2022)
- More ...
-
Local search and constraint programming for the post enrolment-based course timetabling problem
Cambazard, Hadrien, (2012)
-
Local search and constraint programming for the post enrolment-based course timetabling problem
Cambazard, Hadrien, (2012)
- More ...