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

Optimal Shift Scheduling with Multiple Break Windows

Author

Listed:
  • Turgut Aykin

    (Graduate School of Management, RUTGERS, The State University of New Jersey, 180 University Avenue, Newark, New Jersey 07102)

Abstract

This paper presents a new integer programming model for optimal shift scheduling with multiple rest and lunch breaks, and break windows. A set-covering approach for this problem was originally developed by Dantzig (1954). Since then, a number of set-covering-based formulations have been proposed in the literature. These formulations require an integer variable for every shift type, shift start time, and rest/lunch break placement combination. Unfortunately, the number of integer variables required is rather large, making them impractical to solve for an optimal solution in most applications. We present a new approach in which a set of break variables is introduced for every shift-break type combination to determine the break placements. This approach leads to a significantly improved integer programming model requiring substantially smaller number of variables and computer memory. We tested the proposed approach with 40 test problems involving between 1,728 and 8,640 shift variations, and five demand patterns. Our results showed that the proposed formulation is very useful in solving large shift scheduling problems optimally.

Suggested Citation

  • Turgut Aykin, 1996. "Optimal Shift Scheduling with Multiple Break Windows," Management Science, INFORMS, vol. 42(4), pages 591-602, April.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:4:p:591-602
    DOI: 10.1287/mnsc.42.4.591
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.4.591
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.4.591?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:42:y:1996:i:4:p:591-602. 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.