Article ID: | iaor1992137 |
Country: | United States |
Volume: | 9 |
Start Page Number: | 352 |
End Page Number: | 370 |
Publication Date: | Nov 1990 |
Journal: | Journal of Operations Management |
Authors: | Thompson Gary M. |
Keywords: | personnel & manpower planning, programming: linear |
This paper compares two linear programming (LP) models to shift scheduling in services where homogeneously-skilled employees are available at limited times. Although both models are based on set covering approaches, one explicitly matches employees to shifts, while the other imposes this matching implicitly. Each model is used in three forms-one with complete, another with very limited meal break placement flexibility, and a third without meal breaks-to provide initial schedules to a completion/improvement heuristic. The term