2C3 Using SAT Solver for Nurse Scheduling Problem(Technical session 2C: OS2: Timetabling and assignment problems(1)) :

Access this Article

Search this Article

Author(s)

    • Inui Nobuo
    • School of Multidisciplinary Sciences The Graduate University For Advanced Studies

Abstract

This paper proposes a new SAT model for the nurse scheduling problems (NSP). Previously, we solved NSP using a SAT model based on an analogy of the MIP model. But for NSP instances with higher total penalty, experimental results implied that the SAT was not so strong approach. So we, in this paper, discuss a new SAT model about the counting numbers and the window search algorithm. We show the performance by some instances in the Nurse Rostering Contest held in 2010. A new method reduced running time to about 70%, compared with the previous method.

Journal

  • Proceedings of International Symposium on Scheduling

    Proceedings of International Symposium on Scheduling 2011, 97-100, 2011

    日本機械学会

Codes

  • NII Article ID (NAID)
    110009663451
  • NII NACSIS-CAT ID (NCID)
    AA11901544
  • Text Lang
    ENG
  • Data Source
    NII-ELS  NDL-Digital 
Page Top