Advanced Search
MyIDEAS: Login

Combining integer programming and the randomization method to schedule employees

Contents:

Author Info

  • Ingolfsson, Armann
  • Campello, Fernanda
  • Wu, Xudong
  • Cabral, Edgar
Registered author(s):

    Abstract

    We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedure: (1) determine staffing requirements and (2) find a minimum cost schedule that provides the required staffing in every period. Approximations in the first step sometimes cause the two-step approach to find infeasible or suboptimal solutions. Our method iterates between a schedule evaluator and a schedule generator. The schedule evaluator calculates transient service levels using the randomization method and identifies infeasible intervals, where the service level is lower than desired. The schedule generator solves a series of integer programs to produce improved schedules, by adding constraints for every infeasible interval, in an attempt to eliminate infeasibility without eliminating the optimal solution. We present computational results for several test problems and discuss factors that make our approach more likely to outperform previous approaches.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VCT-4W7J102-2/2/072a2f2242e456ec5d2a760de3e57c38
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 202 (2010)
    Issue (Month): 1 (April)
    Pages: 153-163

    as in new window
    Handle: RePEc:eee:ejores:v:202:y:2010:i:1:p:153-163

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords: Service operations management Employee scheduling Staffing requirements Nonstationary queues Randomization method Integer programming;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Örmeci, E. Lerzan & Salman, F. Sibel & Yücel, Eda, 2014. "Staff rostering in call centers providing employee transportation," Omega, Elsevier, vol. 43(C), pages 41-53.
    2. Chen, Gang & Govindan, Kannan & Yang, Zhong-Zhen & Choi, Tsan-Ming & Jiang, Liping, 2013. "Terminal appointment system design by non-stationary M(t)/Ek/c(t) queueing model and genetic algorithm," International Journal of Production Economics, Elsevier, vol. 146(2), pages 694-703.
    3. Izady, Navid & Worthington, Dave, 2012. "Setting staffing requirements for time dependent queueing networks: The case of accident and emergency departments," European Journal of Operational Research, Elsevier, vol. 219(3), pages 531-540.
    4. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:202:y:2010:i:1:p:153-163. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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