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

Multiple Shift Workforce Lower Bounds

Author

Listed:
  • Gerald J. Koop

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

Abstract

Previous lower bounds on workforce size have been derived from the consideration that the number of working shifts which can be provided by the workers over a given period of time must be at least as large as the number of working shifts required by the staffing demands over that period. None of those bounds incorporates the effect of constraints on the changing of shifts in a multiple shift manpower scheduling problem. This paper utilizes a network model of the problem to model its multiple shift aspect and provide new lower bounds on workforce size. For some common special cases of constraints these lower bounds can be calculated by band. For some common special cases of demands the multiple shift lower bounds degenerate to the single shift lower bounds.

Suggested Citation

  • Gerald J. Koop, 1988. "Multiple Shift Workforce Lower Bounds," Management Science, INFORMS, vol. 34(10), pages 1221-1230, October.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:10:p:1221-1230
    DOI: 10.1287/mnsc.34.10.1221
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.10.1221
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.10.1221?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. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.

    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:34:y:1988:i:10:p:1221-1230. 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.