liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Eveborn, Patrik
Publications (4 of 4) Show all publications
Rönnqvist, M., Flisberg, P. & Eveborn, P. (2004). Home care operations. OR/MS today, April, 38-43
Open this publication in new window or tab >>Home care operations
2004 (English)In: OR/MS today, ISSN 1085-1038, Vol. April, p. 38-43Article in journal (Refereed) Published
Abstract [en]

No abstract available.

National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-22746 (URN)2060 (Local ID)2060 (Archive number)2060 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2012-11-22
Rönnqvist, M. & Eveborn, P. (2004). Scheduler - A system for staff planning. Annals of Operations Research, 128( 1-4), 21-45
Open this publication in new window or tab >>Scheduler - A system for staff planning
2004 (English)In: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 128, no 1-4, p. 21-45Article in journal (Refereed) Published
Abstract [en]

Scheduling of staff is an important area, both from an academic and industrial point of view. There has been a lot of attention to develop new and efficient methods and models. In this paper, we consider the problem that given a work-force demand, a set of working rules and regulations find schedules for staff members with individual skills and preferences. The planning horizon is typically one week to several months. The problem both constructs tasks and simultaneously allocates them to staff members. The purpose of this paper is not to develop new theoretical results. Instead it deals with novel applications of known approaches to real-world practice. We describe a general scheduling software called SCHEDULER that includes a number of important features. The model is based on a elastic set-partitioning model and as solution method we use a branch-and-price algorithm. As branching strategy we make use of constraint branching and the column generator is a nested constrained shortest path formulation. An important feature is that only legal schedules are generated and used within the model. The system also allows for task changes within shifts, a general description of legal restrictions, preferences and allowable times. The system is in use at a number of companies and we report on the usage at some companies. We also give some numerical results to illustrate the behavior of some important features.

National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-22748 (URN)2063 (Local ID)2063 (Archive number)2063 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2017-12-13
Flisberg, P., Eveborn, P. & Rönnqvist, M. (2003). Staff planning in the Swedish home care system. Linköping: Linköpings universitet
Open this publication in new window or tab >>Staff planning in the Swedish home care system
2003 (English)Report (Other academic)
Place, publisher, year, edition, pages
Linköping: Linköpings universitet, 2003
Series
LiTH-MAT-R ; 11
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-22365 (URN)1573 (Local ID)1573 (Archive number)1573 (OAI)
Available from: 2009-10-07 Created: 2009-10-07
Eveborn, P. (2002). Models and methods for school timetabling using a column generation approach. (Licentiate dissertation). Linköping: Linköpings universitet
Open this publication in new window or tab >>Models and methods for school timetabling using a column generation approach
2002 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Creating timetables for educational institutions is a complex task, and the quality of the timetables affects a large number of students and teachers. This process involves assigning teachers to courses, students to classes, classrooms to lessons and setting the starting time of the lessons.

In this thesis, models and solution methods are presented for the assignment of starting times and classrooms as appearing in Swedish schools. This school system has two aspects that make timetabling particularly hard. The first is the mix of both individual and class based timetables, and the second that lessons can have any length unlike many other school systems which only has lessons of the same length. For the timetables to be of practical interest, modelling of quality aspects of a timetable is also a major issue.

A first generalised set-packing model is presented for the problem, with a column representing a feasible schedule for one class. Solution techniques involving column generation and constraint branching are developed and presented. This model is deemed too complex to solve, and a sequential solution approach that solves the problem in several stages is presented. The models and solution techniques in the sequential solution approach also involve column generation and constraint branching. The models allow for a capturing many quality aspects of a timetable. The sequential solution approach is tested on a test database, and the results are presented and discussed. A study of improving the performance of the branch-andbound method is finally presented.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet, 2002. p. 79
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 937
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-144751 (URN)9173733067 (ISBN)
Presentation
2002-04-19, BL32, hus B, Campus Valla, Linköping, 10:15 (English)
Opponent
Available from: 2018-02-02 Created: 2018-02-02 Last updated: 2018-04-03Bibliographically approved
Organisations

Search in DiVA

Show all publications