A class of manpower scheduling problems
Tóm tắt
In this paper we formulate a mathematical programming model for solving a class of manpower scheduling problems. The objective is to assign working schedules to a fixed number of employees in order to meet the workforce demand, assumed to be constant over the planning period. Necessary and sufficient conditions of existence of the solution are stated, heuristic methods are presented and the results of computational experiences are reported.
Tài liệu tham khảo
Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math Prog Study 12:37–60
Bartholdi JJ, Orlin JB, Ratliff HD (1980) Cyclic scheduling via integer programming with circular ones. Opns Res 28(5): 1074–1085
Chvatal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4(3):233–235
Hochbaum D (1982) Approximation algorithms for set covering and vertex cover problems. SIAM J Comput 11(3):555–556
Khan MR, Lewis DA (1987) A network model for nursing staff scheduling. ZOR 31(6):B161-B171
Miller HE, Pierskalla WP, Rath GJ (1976) Nurse scheduling using mathematical programming. Opns Res 24(5):857–869
Rosembloom ES, Goertzen NF (1987) Cyclic nurse scheduling. EJOR 31:19–23
Tien JM, Kamiyama A (1982) On manpower scheduling algorithms. SIAM Review 24(3):275–287
Volpentesta A (1981) Vertex characterizations of some polyhedra related to row circular matrices. Methods Opns Res 45:377–389
Bartholdi JJ III, Ratliff HD (1978) Unnetworks with applications to idle time scheduling. Man Sc 24(8):850–858
Tibrewala R, Philippe D, Browne J (1972) Optimal scheduling of two consecutive idle periods. Man Sc 19(1):71–75
Baker KR (1976) Workforce allocation in cyclical scheduling problems: a survey. Opl Res Q 27(1):155–167