Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling

Published Online:https://doi.org/10.1287/mnsc.1100.1264

References

  • Aykin T. Optimal shift scheduling with multiple break windows. Management Sci. (1996) 42(4):591–602LinkGoogle Scholar
  • Bechtolds S., Jacobs L. Implicit optimal modeling of exible break assigments. Management Sci. (1990) 36(11):1339–1351LinkGoogle Scholar
  • Bouchard M. Optimisation des pauses dans le probléme de fabrication des horaires avec quarts de travail. (2004) . Master's thesis, École Polytechnique de Montréal, MontrealGoogle Scholar
  • Côté M.-C., Gendron B., Rousseau L.-M. Modeling the regular constraint with integer programming. Proc. CPAIOR 2007 (2007) 4510(Springer-Verlag, Berlin) 29–43Lecture Notes in Computer ScienceGoogle Scholar
  • Côté M.-C., Gendron B., Quimper C.-G., Rousseau L.-M. Formal languages for integer programming modeling of shift scheduling problems. Constraints (2009) . ePub ahead of print October 27, http://www.springerlink.com/content/h5803278l5364571/Google Scholar
  • Dantzig G. A comment on “Edie's traffic delay at toll booths”. J. Oper. Res. Soc. Amer. (1954) 2(3):339–341LinkGoogle Scholar
  • Demassey S., Pesant G., Rousseau L.-M. A cost-regular based hybrid column generation approach. Constraints (2006) 11(4):315–333CrossrefGoogle Scholar
  • Edie L. Traffic delays at toll booths. J. Oper. Res. Soc. Amer. (1954) 2(2):107–138LinkGoogle Scholar
  • Ernst A., Jiang H., Krishnamoorthy M., Owens B., Sier D. An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. (2004a) 127(1–4):21–144CrossrefGoogle Scholar
  • Ernst A., Jiang H., Krishnamoorthy M., Sier D. Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. (2004b) 153(1):3–27CrossrefGoogle Scholar
  • Henderson W. B., Berry W. J. Heuristic methods for telephone operator shift scheduling: An experimental analysis. Management Sci. (1976) 22(12):1372–1380LinkGoogle Scholar
  • Hopcroft J., Motwani R., Ullman J. D.Introduction to Automata Theory, Languages, and Computation (2001) (Addison Wesley, Boston) Google Scholar
  • Lequy Q., Bouchard M., Desaulniers G., Soumis F. Assigning multiple activities to work shifts. (2009) . Technical report, Les Cahiers du GERAD G-2009-86, GERAD, MontrealGoogle Scholar
  • Loucks J. S., Jacobs F. R. Tour scheduling and task assignment of a heterogeneous work force: A heuristic approach. Decision Sci. (1991) 22(4):719–739CrossrefGoogle Scholar
  • Mehrotra A., Murphy K., Trick M. Optimal shift scheduling: A branch-and-price approach. Naval Res. Logist. (2000) 47(3):185–200CrossrefGoogle Scholar
  • Pesant G., Quimper C.-G., Rousseau L.-M., Sellmann M. The polytope of context-free grammar constraints. Proc. CPAIOR 2009 (2009) 5547(Springer-Verlag, Berlin) 223–232Lecture Notes in Computer ScienceGoogle Scholar
  • Quimper C.-G., Walsh T. Decomposing global grammar constraints. Proc. of CP 2007 (2007) 4741(Springer-Verlag, Berlin) 590–604Lecture Notes in Computer ScienceGoogle Scholar
  • Rekik M., Cordeau J.-F., Soumis F. Using Benders decomposition to implicitly model tour scheduling. Ann. Oper. Res. (2004) 128(1–4):111–133CrossrefGoogle Scholar
  • Rekik M., Cordeau J.-F., Soumis F. Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Scheduling (2010) 13(1):49–75CrossrefGoogle Scholar
  • Ritzman L., Krajewski L. J., Showalter M. J. The disaggregation of aggregate manpower plans. Management Sci. (1976) 22(11):1204–1214LinkGoogle Scholar
  • Segal M. The operator-scheduling problem: A network-flow approach. Oper. Res. (1974) 22(4):808–823LinkGoogle Scholar
  • Thompson G. Improved implicit optimal modeling of the labor shift scheduling problem. Management Sci. (1995) 41(4):595–607LinkGoogle Scholar
  • Vatri E. Integration de la génération de quart de travail et de l'attribution d'activités. (2001) . Master's thesis, École Polytechnique de Montréal, MontrealGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.