IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i5p599-607.html
   My bibliography  Save this article

Work Force Size and Single Shift Schedules with Variable Demands

Author

Listed:
  • R. N. Burns

    (School of Business, Queen's University, Kingston, Ontario, Canada K7L 3N6)

  • M. W. Carter

    (School of Business, Queen's University, Kingston, Ontario, Canada K7L 3N6)

Abstract

In recent years, labour negotiations for seven-day-week organizations such as hospitals, mining companies and chemical industries have seen an increased emphasis on improving shift schedules. This paper gives an exact lower bound on the number of workers required to satisfy such primary contractual commitments as ensuring that each employee receives at least A out of every B weekends off, everyone works exactly five days per week, and no one works more than six consecutive days. The model addressed is general in that it allows the number of workers required each day to vary. The proof that the bound is the best possible is constructive. A linear time algorithm is presented that generates schedules satisfying all the primary objectives. Extensions discuss means of incorporating secondary objectives such as giving pairs of adjacent days off.

Suggested Citation

  • R. N. Burns & M. W. Carter, 1985. "Work Force Size and Single Shift Schedules with Variable Demands," Management Science, INFORMS, vol. 31(5), pages 599-607, May.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:5:p:599-607
    DOI: 10.1287/mnsc.31.5.599
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.5.599
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.5.599?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
    ---><---

    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:ormnsc:v:31:y:1985:i:5:p:599-607. 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.