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

• Inui,Nobuo

  School of Multidisciplinary Sciences The Graduate University For Advanced Studies

• Ikegami,Atsuko

  Department of Science and Engineering Seikei University

抄録

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.

収録刊行物

• Proceedings of International Symposium on Scheduling

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

  日本機械学会

キーワード

• Nurse Scheduling
• Combinatorial Optimization
• SAT
• Exact Solution

詳細情報

• CRID: 1543105995089966848
• NII論文ID: 110009663451
• NII書誌ID: AA11901544
• Web Site: http://dl.ndl.go.jp/info:ndljp/pid/10355851
• 本文言語コード: en
• データソース種別:
  • NDL-Digital
  • CiNii Articles