Temporal constraint satisfaction techniques in job shop scheduling problem solving

DOI10.1023/A:1009777711218zbMath0911.68188OpenAlexW1853816584MaRDI QIDQ1273470

Saïd Belhadji, Amar Isli

Publication date: 9 March 1999

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009777711218

zbMATH Keywords

job shop schedulingfragmentation problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Backtracking algorithms for disjunctions of temporal constraints