A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

This paper introduces a practical approach to multiple-shift manpower scheduling by presenting an algorithm that applies the approach to a large and common class of problems. The algorithm constructs schedules that utilize no more than the minimum number of workers necessary for a schedule satisfyin...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 1987-01, Vol.35 (1), p.100-110
Main Authors: Burns, R. N, Koop, G. J
Format: Article
Language:English
Subjects:
581 manpower scheduling
Algorithms
Applications
Applied sciences
Burns
Computer systems
Exact sciences and technology
Human resources
Integers
Modular
Multiple
Operational research and scientific management
Operational research. Management science
Optimal
Planning. Forecasting
Research universities
Scheduling
Shifts
Staffing
Symbols
Workforce
Workforce planning
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces a practical approach to multiple-shift manpower scheduling by presenting an algorithm that applies the approach to a large and common class of problems. The algorithm constructs schedules that utilize no more than the minimum number of workers necessary for a schedule satisfying constraints that include two offdays each week, a specified number of offweekends in any fixed number of consecutive weekends, a maximum of six consecutive work shifts and different staffing demands for each type of shift. We discuss the application of the approach to several other classes of manpower scheduling problems.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.35.1.100