Abstract
We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We describe in detail how the continuity of tasks over the week is achieved to suit the wishes of the planner. Finally, we discuss the implementation of the algorithm in the package IPS. Its main characteristic is the introduction of profiles, which easily allows the user to steer the algorithm.
Original language | English |
---|---|
Title of host publication | Practice and Theory of Automated Timetabling IV |
Subtitle of host publication | 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002. Selected Revised Papers |
Editors | Edmund Burke, Patrick De Causmaecker |
Pages | 113-119 |
ISBN (Electronic) | 978-3-540-45157-0 |
DOIs | |
Publication status | Published - 2003 |
Event | 4th International Conference on Practice and Theory of Automated Timetabling, PATAT 2002 - Gent, Belgium Duration: 21 Aug 2002 → 23 Aug 2002 Conference number: 4 http://www.patatconference.org/patat2002/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Volume | 2740 |
Conference
Conference | 4th International Conference on Practice and Theory of Automated Timetabling, PATAT 2002 |
---|---|
Abbreviated title | PATAT 2002 |
Country/Territory | Belgium |
City | Gent |
Period | 21/08/02 → 23/08/02 |
Internet address |
Keywords
- IR-79816