Interactive scheduling as a constraint satisfiability problem

DOI10.1007/BF01531070zbMath0878.68026MaRDI QIDQ1356209

Martin Charles Golumbic, Ronen Feldman

Publication date: 14 December 1997

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

zbMATH Keywords

constraint satisfiability problemstudent scheduling problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Backtrack programming techniques
• Synthesizing constraint expressions

This page was built for publication: Interactive scheduling as a constraint satisfiability problem