Near-optimal MIP solutions for preference based self-scheduling

Eyjólfur Ingi Ásgeirsson () and Guðríður Lilla Sigurðardóttir
Additional contact information
Eyjólfur Ingi Ásgeirsson: Reykjavík University & ICE-TCS
Guðríður Lilla Sigurðardóttir: Reykjavík University

Annals of Operations Research, 2016, vol. 239, issue 1, No 15, 273-293

Abstract: Abstract Making a high quality staff schedule is both difficult and time consuming for any company that has employees working on irregular schedules. We formulate a mixed integer program (MIP) to find a feasible schedule that satisfies all hard constraints while minimizing the soft constraint violations as well as satisfying as many of the employees’ requests as possible. We present the MIP model and show the result from four real world companies and institutions. We also compare the results with those of a local search based algorithm that is designed to emulate the solution strategies when the schedules are created manually. The results show that using near-optimal solutions from the MIP model, with a relative MIP gap of around 0.01–0.1, instead of finding the optimal solution, allows us to find very good solutions in a reasonable amount of time that compare favorably with both the manual solutions and the solutions found by the local search based algorithm.

Keywords: Staff scheduling; Rostering; Mixed integer programming; Local search (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-014-1597-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:239:y:2016:i:1:d:10.1007_s10479-014-1597-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-014-1597-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().