Manpower scheduling with shift change constraints
We consider a problem in manpower scheduling, called the Change Shift Assignment Problem (CSAP) which is concerned with the construction of workers' schedules which satisfy demand and shift change constraints. We show that CSAP is NP-hard in general, and present polynomial-time algorithms to so...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1994
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/1602 http://doi.org/10.1007/3-540-58325-4_230 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | We consider a problem in manpower scheduling, called the Change Shift Assignment Problem (CSAP) which is concerned with the construction of workers' schedules which satisfy demand and shift change constraints. We show that CSAP is NP-hard in general, and present polynomial-time algorithms to solve three practical cases of CSAP. |
|---|