Schedule-Based Group Assignment Using Constraint Programming | Zendy

Thomas Roeder | Zendy; Robert M. Saltzman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Schedule-Based Group Assignment Using Constraint Programming

Author(s) -

Thomas Roeder,

Robert M. Saltzman

Publication year - 2014

Publication title -

informs transactions on education

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.161

H-Index - 3

ISSN - 1532-0545

DOI - 10.1287/ited.2013.0116

Subject(s) - computer science , constraint programming , schedule , constraint (computer aided design) , group (periodic table) , quality (philosophy) , process (computing) , operations research , constraint satisfaction , mathematical optimization , software engineering , industrial engineering , programming language , artificial intelligence , stochastic programming , mathematics , engineering , philosophy , chemistry , geometry , organic chemistry , epistemology , operating system , probabilistic logic

Group work is an important aspect of the educational process in many disciplines, especially business. The literature suggests there are pedagogical advantages to instructor-assigned teams. In this paper, we present a constraint programming approach to assigning students to groups based on their availability. We compare solutions created using several objectives and find that no single objective dominates for all performance measures. Using the model produces group assignments of higher quality and much more quickly than those produced manually.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research