Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
From MaRDI portal
Publication:1854756
DOI10.1023/A:1021197120431zbMath1013.90057OpenAlexW11186253MaRDI QIDQ1854756
Erwin Pesch, Toàn Phan-Huy, Ulrich Dorndorf
Publication date: 27 January 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021197120431
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Depth-first heuristic search for the job shop scheduling problem ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ An advanced tabu search algorithm for the job shop problem
This page was built for publication: Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
