WEKO3
-
RootNode
アイテム
Manpower Scheduling with Shift Change Constraints
https://ipsj.ixsq.nii.ac.jp/records/13938
https://ipsj.ixsq.nii.ac.jp/records/1393833ace353-db70-4fb5-9d45-84b1ea4e4c61
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL3605023.pdf (1.1 MB)
|
Copyright (c) 1995 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1995-05-15 | |||||||
| タイトル | ||||||||
| タイトル | Manpower Scheduling with Shift Change Constraints | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Manpower Scheduling with Shift Change Constraints | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | アルゴリズム | |||||||
| 著者所属 | ||||||||
| Department of Computer Science Tokyo Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Tokyo Institute of Technology | ||||||||
| 著者名 |
LauHoong-Chuln
× LauHoong-Chuln
|
|||||||
| 著者名(英) |
Lau, Hoong-Chuln
× Lau, Hoong-Chuln
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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 con-cerned 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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 con-cerned 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 36, 号 5, p. 1271-1279, 発行日 1995-05-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
