Skip to main content
Log in

Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In constructing working shifts, the classical Dantzig (Operation Research 2:339–341, 1954) set covering model uses a great number of variables which makes computation very complicated for some cases that incorporate a high degree of break-placement flexibility. Bechtold and Jacobs (Management Science 36:1339–1351, 1990) proposed an implicit model under the assumption that there is no extraordinary overlap, which considerably reduced the number of variables. In this paper we give a generalization that is valid without this hypothesis by adding a minimal set of constraints. Also, in some cases where there is extraordinary overlap we reduce our constraint set to a subset with the same number or less than that of Bechtold and Jacobs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alfares, H. K. (2004). Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research, 127, 145–175.

    Article  Google Scholar 

  • Aykin, T. (1996). Optimal shift scheduling with multiple break windows. Management Science, 42, 591–602.

    Google Scholar 

  • Aykin, T. (1998). A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows. Journal of the Operational Research Society, 49, 603–615.

    Article  Google Scholar 

  • Aykin, T. (2000). A comparative evaluation of modeling approaches to the labor shift scheduling problem. European Journal of Operational Research, 125, 381–397.

    Article  Google Scholar 

  • Bechtold, S. E., & Jacobs, L. W. (1990). Implicit modeling of flexible break assignment in optimal shift scheduling. Management Science, 36, 1339–1351.

    Google Scholar 

  • Bechtold, S. E., & Jacobs, L. W. (1996). The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Research Logistics, 43, 233–249.

    Article  Google Scholar 

  • Brusco, M. J., & Jacobs, L. W. (2000). Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Science, 46, 1630–1641.

    Article  Google Scholar 

  • Çezik, T., & Günlük, O. (2004). Reformulating linear programs with transportation constraints-with applications to workforce scheduling. Naval Research Logistics, 51, 275–296.

    Article  Google Scholar 

  • Dantzig, G. B. (1954). A comment on Edie’s traffic delays at toll booths. Operation Research, 2, 339–341.

    Google Scholar 

  • Ernst, A. T., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127, 21–144.

    Article  Google Scholar 

  • Ford, L. R. Jr., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.

    Google Scholar 

  • Herbers, J. (2005). Models and algorithms for ground staff scheduling on airports. Doctoral Dissertation, March 2005. Available online at the URL http://sylvester.bth.rwth-aachen.de/dissertationen/2005/070/05_070.pdf

  • Isken, M. W. (2004). An implicit tour scheduling model with applications in health care. Annals of Operations Research, 128, 91–109.

    Article  Google Scholar 

  • Jacobs, L. W., & Brusco, (1996). Overlapping start-time bands in implicit tour scheduling. Management Science, 42, 1247–1259.

    Google Scholar 

  • Jacobs, L. W., & Brusco, (1998). Personal tour scheduling when starting time restrictions are present. Management Science, 44, 534–547.

    Google Scholar 

  • Jarrah, A. I. Z., Bard, J. F., & De Silva, H. (1994). Solving large-scale tour scheduling problems. Management Science, 40, 1124–1144.

    Article  Google Scholar 

  • Rekik, M., Cordeau, J. -F., & Soumis, F. (2004). Using Benders decomposition to implicitly model tour scheduling. Annals of Operations Research, 128, 111–133.

    Article  Google Scholar 

  • Thompson, G. M. (1995). Improved implicit optimal modeling of the labor shift scheduling problem. Management Science, 41, 595–607.

    Google Scholar 

  • Thompson, G. M. (2003). Labor scheduling: a commentary. Cornell Hotel and Restaurant Administration Quarterly, 44, 149–155.

    Article  Google Scholar 

  • Topaloglu, S., & Ozkarahan, I. (2002). Implicit optimal tour scheduling with flexible break assignments. Computers and Industrial Engineering, 44, 75–89.

    Article  Google Scholar 

  • Topaloglu, S., & Ozkarahan, I. (2004). An implicit goal programming model for the tour scheduling problem considering the employee work preferences. Annals of Operations Research, 128, 135–158.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Idris Addou.

Additional information

I. Addou’s current address is Département de Mathématiques et Statistique, Université de Montréal, Succ. Centre-ville, Montréal, Québec, Canada, H3C2J7; e-mail: addou@dms.umontreal.ca.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Addou, I., Soumis, F. Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap. Ann Oper Res 155, 177–205 (2007). https://doi.org/10.1007/s10479-007-0222-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0222-0

Keywords

Navigation