Integer programming techniques for the nurse rostering problem
| Autor: | Sabir Ribas, Haroldo Gambini Santos, Túlio Ângelo Machado Toffolo, Rafael Antonio Marques Gomes |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Mathematical optimization
021103 operations research Current generation 0211 other engineering and technologies General Decision Sciences 02 engineering and technology Management Science and Operations Research Dual (category theory) Nursing Nurse scheduling problem Theory of computation 0202 electrical engineering electronic engineering information engineering Code (cryptography) 020201 artificial intelligence & image processing Heuristics Integer programming Mathematics |
| Zdroj: | Annals of Operations Research. 239:225-251 |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-014-1594-6 |
| Popis: | This work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced the following results: the optimality of the vast majority of instances was proved, the best known solutions were improved by up to 15 % and strong dual bounds were obtained. In the spirit of reproducible science, all code was implemented using the Computational Infrastructure for Operations Research. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink