David Applegate & William Cook (1991):
A Computational Study of the Job-Shop Scheduling Problem.
ORSA Journal on Computing 3(2),
pp. 149–156,
doi:10.1287/ijoc.3.2.149.
Giacomo Da Col & Erich C Teppan (2016):
Declarative decomposition and dispatching for large-scale job-shop scheduling.
In: Joint German/Austrian Conference on Artificial Intelligence (Künstliche Intelligenz).
Springer,
pp. 134–140,
doi:10.1007/978-3-319-46073-4_11.
Giacomo Da Col & Erich C Teppan (2019):
Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers.
In: CP 2019: Principles and Practice of Constraint Programming.
Emilie Danna, Edward Rothberg & Claude Le Pape (2003):
Integrating mixed integer programming and local search: A case study on job-shop scheduling problems.
In: Fifth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’2003),
pp. 65–79.
Mark S Fox, Bradley P Allen & Gary Strohm (1982):
Job-Shop Scheduling: An Investigation in Constraint-Directed Reasoning..
In: AAAI,
pp. 155–158.
Philippe Laborie & Daniel Godard (2007):
Self-adapting large neighborhood search: Application to single-mode scheduling problems.
Proceedings MISTA-07, Paris 8.
Philippe Laborie & Jérôme Rogerie (2016):
Temporal linear relaxation in IBM ILOG CP Optimizer.
Journal of Scheduling 19(4),
pp. 391–400,
doi:10.1007/s10951-014-0408-7.
Philippe Laborie, Jérôme Rogerie, Paul Shaw & Petr Vilím (2018):
IBM ILOG CP optimizer for scheduling.
Constraints 23(2),
pp. 210–250,
doi:10.1007/s10601-018-9281-x.
S. Lawrence (1984):
Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement).
Graduate School of Industrial Administration, Carnegie-Mellon University.
Norman M. Sadeh & Mark S. Fox (1996):
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.
Artificial Intelligence 86,
pp. 1–41,
doi:10.1016/0004-3702(95)00098-4.
Robert H Storer, S David Wu & Renzo Vaccari (1992):
New search spaces for sequencing problems with application to job shop scheduling.
Management science 38(10),
pp. 1495–1509,
doi:10.1287/mnsc.38.10.1495.
Eric Taillard (1993):
Benchmarks for basic scheduling problems.
european journal of operational research 64(2),
pp. 278–285,
doi:10.1016/0377-2217(93)90182-M.
Erich C Teppan & Giacomo Da Col (2018):
Automatic Generation of Dispatching Rules for Large Job Shops by Means of Genetic Algorithms.
In: 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA 2018),
pp. 43–57.
Manuel Vazquez & L Darrell Whitley (2000):
A comparison of genetic algorithms for the dynamic job shop scheduling problem.
In: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation.
Morgan Kaufmann Publishers Inc.,
pp. 1011–1018.
Petr Vilím, Philippe Laborie & Paul Shaw (2015):
Failure-directed search for constraint-based scheduling.
In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems.
Springer,
pp. 437–453,
doi:10.1007/978-3-319-18008-3_30.
Takeshi Yamada & Ryohei Nakano (1992):
A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems..
In: PPSN,
pp. 283–292.
eptcs@eptcs.org