Maintenance scheduling problems as benchmarks for constraint algorithms

DOI10.1023/A:1018906911996zbMath0940.68037OpenAlexW1707765878MaRDI QIDQ1978021

Rina Dechter, Daniel Frost

Publication date: 7 June 2000

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

schedulingsearch algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Partition search for non-binary constraint satisfaction ⋮ Unnamed Item ⋮ A non-binary constraint ordering heuristic for constraint satisfaction problems

This page was built for publication: Maintenance scheduling problems as benchmarks for constraint algorithms