Constraint Propagation Based Scheduling of Job Shops
From MaRDI portal
Publication:5284222
DOI10.1287/ijoc.8.2.144zbMath0866.90075MaRDI QIDQ5284222
Erwin Pesch, Ulrich A. W. Tetzlaff
Publication date: 22 January 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.8.2.144
artificial intelligence; job shop; minimum makespan; propagation and decomposition techniques; special purpose heuristics
90B35: Deterministic scheduling theory in operations research
Related Items
Constraint propagation techniques for the disjunctive scheduling problem, Resource-constrained project scheduling: Notation, classification, models, and methods, Deterministic job-shop scheduling: Past, present and future