Skip to main content
SpringerLink
Log in

A class of manpower scheduling problems

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math Prog Study 12:37–60

    Google Scholar 

  2. Bartholdi JJ, Orlin JB, Ratliff HD (1980) Cyclic scheduling via integer programming with circular ones. Opns Res 28(5): 1074–1085

    Google Scholar 

  3. Chvatal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4(3):233–235

    Google Scholar 

  4. Hochbaum D (1982) Approximation algorithms for set covering and vertex cover problems. SIAM J Comput 11(3):555–556

    Google Scholar 

  5. Khan MR, Lewis DA (1987) A network model for nursing staff scheduling. ZOR 31(6):B161-B171

    Google Scholar 

  6. Miller HE, Pierskalla WP, Rath GJ (1976) Nurse scheduling using mathematical programming. Opns Res 24(5):857–869

    Google Scholar 

  7. Rosembloom ES, Goertzen NF (1987) Cyclic nurse scheduling. EJOR 31:19–23

    Google Scholar 

  8. Tien JM, Kamiyama A (1982) On manpower scheduling algorithms. SIAM Review 24(3):275–287

    Google Scholar 

  9. Volpentesta A (1981) Vertex characterizations of some polyhedra related to row circular matrices. Methods Opns Res 45:377–389

    Google Scholar 

  10. Bartholdi JJ III, Ratliff HD (1978) Unnetworks with applications to idle time scheduling. Man Sc 24(8):850–858

    Google Scholar 

  11. Tibrewala R, Philippe D, Browne J (1972) Optimal scheduling of two consecutive idle periods. Man Sc 19(1):71–75

    Google Scholar 

  12. Baker KR (1976) Workforce allocation in cyclical scheduling problems: a survey. Opl Res Q 27(1):155–167

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Informatica ed Appl., Univ. Salerno, 84100, Fisciano, Italia

    R. Cerulli & R. Mautone

  2. Dip. Sistemi, Univ. Calabria, 87036, Rende (CS), Italia

    M. Gaudioso

Authors
  1. R. Cerulli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Gaudioso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Mautone
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cerulli, R., Gaudioso, M. & Mautone, R. A class of manpower scheduling problems. ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 36, 93–105 (1992). https://doi.org/10.1007/BF01541035

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01541035

Keywords

Search

Navigation