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

Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling

Author

Listed:
  • Stephen E. Bechtold

    (Florida State University, College of Business, Tallahassee, Florida 32306-1402)

  • Larry W. Jacobs

    (Northern Illinois University, College of Business, DeKalb, Illinois 60115)

Abstract

The labor scheduling literature has demonstrated that the use of flexibility in designing employee schedules can result in a substantial improvement in labor utilization. This paper presents a new implicit integer linear programming formulation for the inclusion of meal/rest-break flexibility. Although the use of flexible break assignments in labor staffing decisions has been of research interest since an early article by Segal (1974), due to problem size, the majority of related research has involved the use of heuristics. An experimental analysis using four different labor requirements patterns and ten shift-length combinations demonstrated that, when flexible break assignments were modeled, the implicit formulation was superior to the traditional set-covering formulation with respect to 1) execution time, 2) computer memory requirements, and 3) the ability to produce optimal integer solutions to larger problems incorporating greater flexibility. Finally, a number of possible extensions of the implicit modeling approach for use in other labor scheduling environments are identified.

Suggested Citation

  • Stephen E. Bechtold & Larry W. Jacobs, 1990. "Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling," Management Science, INFORMS, vol. 36(11), pages 1339-1351, November.
  • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:11:p:1339-1351
    DOI: 10.1287/mnsc.36.11.1339
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.11.1339
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.36.11.1339?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:36:y:1990:i:11:p:1339-1351. 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.