IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i3p484-495.html
   My bibliography  Save this article

Off-Day Scheduling with Hierarchical Worker Categories

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University, Cleveland, Ohio)

  • Richard N. Burns

    (Queen's University, Kingston, Ontario, Canada)

Abstract

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 D k workers of type- k or better, of which at least d k 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.

Suggested Citation

  • Hamilton Emmons & Richard N. Burns, 1991. "Off-Day Scheduling with Hierarchical Worker Categories," Operations Research, INFORMS, vol. 39(3), pages 484-495, June.
  • Handle: RePEc:inm:oropre:v:39:y:1991:i:3:p:484-495
    DOI: 10.1287/opre.39.3.484
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.3.484
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.39.3.484?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ulusam Seckiner, Serap & Gokcen, Hadi & Kurt, Mustafa, 2007. "An integer programming model for hierarchical workforce scheduling problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 694-699, December.
    2. Narasimhan, Rangarajan, 1997. "An algorithm for single shift scheduling of hierarchical workforce," European Journal of Operational Research, Elsevier, vol. 96(1), pages 113-121, January.
    3. Lishun Zeng & Mingyu Zhao & Yangfan Liu, 2019. "Airport ground workforce planning with hierarchical skills: a new formulation and branch-and-price approach," Annals of Operations Research, Springer, vol. 275(1), pages 245-258, April.
    4. Azmat, Carlos S. & Widmer, Marino, 2004. "A case study of single shift planning and scheduling under annualized hours: A simple three-step approach," European Journal of Operational Research, Elsevier, vol. 153(1), pages 148-175, February.
    5. Jonathan F. Bard & Lin Wan, 2008. "Workforce Design with Movement Restrictions Between Workstation Groups," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 24-42, November.
    6. Hertz, Alain & Lahrichi, Nadia & Widmer, Marino, 2010. "A flexible MILP model for multiple-shift workforce planning under annualized hours," European Journal of Operational Research, Elsevier, vol. 200(3), pages 860-873, February.
    7. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:39:y:1991:i:3:p:484-495. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.