Off-Day Scheduling with Hierarchical Worker Categories
Autor: | Hamilton Emmons, Richard N. Burns |
---|---|
Rok vydání: | 1991 |
Předmět: |
Nursing staff
Operations research Computer science Staff management Personnel Staffing and Scheduling Hierarchy Social Models Theoretical Nursing Staff Hospital Management Science and Operations Research United States Computer Science Applications Work force Scheduling (computing) Methods Operations management Algorithms Personnel Staffing and Scheduling Information Systems |
Zdroj: | Operations Research. 39:484-495 |
ISSN: | 1526-5463 0030-364X |
DOI: | 10.1287/opre.39.3.484 |
Popis: | A work force includes workers of m types. The worker categories are ordered, with type-1 workers the most highly qualified, type-2 the next, and so on. If the need arises, a type-k worker is able to substitute for a worker of any type j > k (k = 1, …, m − 1). For 7-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 that each worker must have 2 off-days per week and a given fraction of weekends off. Algorithms are presented which generate a feasible schedule, and provide work stretches between 2 and 5 days, and consecutive weekdays off when on duty for 2 weekends in a row, without additional staff. |
Databáze: | OpenAIRE |
Externí odkaz: |
Pro tento záznam nejsou dostupné žádné jednotky.