Manpower Scheduling with Shift Change Constraints

スポンサーリンク

概要

• 論文の詳細を見る

• Manpower scheduling is a critical operation in service organizations which operate round-the-clock. It is an active topic in operations research. In this paper, we consider a problem in manpower scheduling, called the Change Shift Assignment Problem (CSAP), which is concerned with the assignment of shifts to workers such that demands for manpower are satisfied and constraints governing the change of shifts are not violated. We show that CSAP is NP-hard in general, and propose efficient polynomial-time algorithms to solve three practical sub-problems of CSAP.

• 一般社団法人情報処理学会の論文
• 1995-05-15

著者

• Lau Hoong-chuin

  Department Of Computer Science Tokyo Institute Of Technology

関連論文

• Manpower Scheduling with Shift Change Constraints

スポンサーリンク