Using Preferences to Solve Student–Class Allocation Problem

Autor:	E. Anguiano, Luis Sánchez, David Camacho, Estrella Pulido, Juan I. Cano
Rok vydání:	2009
Předmět:	Mathematical optimization Computer science Educational resources Idle time Constraint satisfaction problem Scheduling (computing)
Zdroj:	Intelligent Data Engineering and Automated Learning-IDEAL 2009 ISBN: 9783642043932 IDEAL
DOI:	10.1007/978-3-642-04394-9_76
Popis:	Resource allocation is a form of Constraint Satisfaction Problem (CSP) in which a set of resources must be assigned to a set of agents. Multiagent Resource Allocation (MARA) makes possible solving CSP using qualitative parameters as, for example, reduce idle time in scheduling or preferences over the set of resources to be allocated. In this paper, we are going to use a MARA approach to find a solution to the student-class allocation problem, where each class has a number of seats, each student has his preferences over the schedule and the institution requests a uniform distribution of the students in classes and some other rules.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::dd2757006ca39da98d27df87b4d27301 https://doi.org/10.1007/978-3-642-04394-9_76 Zobrazit plný text záznamu