Interactive scheduling as a constraint satisfiability problem

DOI10.1007/BF01531070MaRDI QIDQ1356209zbMATH OpenFDO

Authors Ronen Feldman, Martin Charles Golumbic

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

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

Recommendations

• Publication:3198899
• Constraint satisfaction problems: Algorithms and applications
• scientific article; zbMATH DE number 802345
• scientific article; zbMATH DE number 1234562

Cites work

• scientific article; zbMATH DE number 4174362 (Why is no real title available?)
• Backtrack programming techniques
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Synthesizing constraint expressions

Cited in

(2)

• Advances in Artificial Intelligence
• scientific article; zbMATH DE number 4174362 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356209)