Research Reports from the Department of Operations
Document Type
Report
Publication Date
8-1-1988
Abstract
Workers of m types are available with type k (k=1,...,m-1) more highly qualified and able to substitute for types k+1,...,m. For seven-day-a-week operation, daily requirements are for at least dk workers of type k or better, of which at least dk must be precisely type k. Formulas are given to find the smallest number and most economical mix of workers, assuming each worker must have two off-days per week and a given fraction of weekends off. Algorithms are presented which generate a feasible schedule, and provide workstretches between two and five days, and consecutive weekdays off when on duty for two weekends in a row, without additional staff.
Keywords
Operations research, Manpower planning, Scheduling, Production scheduling, Algorithms
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 621
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Emmons, Hamilton and Burns, Richard N., "Off-Day Scheduling with Hierarchical Worker Categories" (1988). Research Reports from the Department of Operations. 347.
https://commons.case.edu/wsom-ops-reports/347
