Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

Published Online:https://doi.org/10.1287/ijoc.1120.0514

References

  • Aykin T. Optimal shift scheduling with multiple break windows. Management Sci. (1996) 42(4):591–602LinkGoogle Scholar
  • Barnhart C, Hane CA, Vance PH. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. (2000) 48(2):318–326LinkGoogle Scholar
  • Bechtolds S, Jacobs L. Implicit optimal modeling of flexible break assigments. Management Sci. (1990) 36(11):1339–1351LinkGoogle Scholar
  • Bouchard M. Attribution des activités aux employés travaillant sur des quarts. (2004) . M.Sc. Thesis, Ecole Polytechnique de Montréal, MontréalGoogle Scholar
  • Côté M-C, Gendron B, Rousseau L-M. Grammar-based integer programming models for multi-activity shift scheduling. Management Sci. (2011a) 57(1):151–163LinkGoogle Scholar
  • Côté M-C, Gendron B, Quimper C-G, Rousseau L-M. Formal languages for integer programming modeling of shift scheduling problems. Constraints (2011b) 16(1):54–76CrossrefGoogle Scholar
  • Crainic TG, Frangioni A, Gendron B, Guertin F. OOBB: An object-oriented library for parallel branch-and-bound. (2009) Presentation. CORS/INFORMS International ConferenceJune 14–17Toronto, CanadaGoogle Scholar
  • Dantzig G. A comment on Edie's traffic delay at toll booths. J. Oper. Res. Soc. America (1954) 2(3):339–341LinkGoogle Scholar
  • Dantzig G, Wolfe P. Decomposition principle for linear programs. Oper. Res. (1960) 8(1):101–111LinkGoogle Scholar
  • Demassey S, Pesant G, Rousseau L-M. A cost-regular based hybrid column generation approach. Constraints (2006) 11(4):315–333CrossrefGoogle Scholar
  • Desaulniers G, Desrosiers J, Solomon MM. Column Generation (2005) (Springer, New York) CrossrefGoogle Scholar
  • Edie L. Traffic delays at toll booths. J. Oper. Res. Soc. America (1954) 2(2):107–138LinkGoogle Scholar
  • Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B. Constraint programming based column generation for crew assignment. J. Heuristics (2002) 8(1):59–81CrossrefGoogle Scholar
  • Gent I, Harvey W, Kelsey T. Groups and constraints: Symmetry breaking during search. Principles and Practice of Constraint Programming—CP 2002 (2006) 2470:233–240Google Scholar
  • Hopcroft J, Motwani R, Ullman JD. Introduction to Automata Theory, Languages, and Computation (2001) (Addison Wesley, Boston) Google Scholar
  • Kadioglu S, Sellmann M. Grammar constraints. Constraints (2010) 15(1):117–144CrossrefGoogle Scholar
  • Katsirelos G, Narodytska N, Walsh T, Perron L, Trick M. The weighted cfg constraint. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optim. Problems (2008) (Springer-Verlag, Heidelberg) 323–327Lecture Notes in Computer Science, Vol. 5015CrossrefGoogle Scholar
  • Lequy Q, Bouchard M, Desaulniers G, Soumis F. Assigning multiple activities to work shifts. J. Scheduling (2012) 15(2):239–251CrossrefGoogle Scholar
  • Loucks JS, Jacobs FR. Tour scheduling and task assignment of a heterogeneous work force: A heuristic approach. Decision Sci. (1991) 22:719–739CrossrefGoogle Scholar
  • Lübbecke ME, Desrosiers J. Selected topics on column generation. Oper. Res. (2005) 53(6):1007–1023LinkGoogle Scholar
  • Menana J, Demassey S. Sequencing and counting with the multicost-regular constraint. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optim. Problems (2009) (Springer-Verlag, Heidelberg) 178–192Lecture Notes in Computer Science, Vol. 5547CrossrefGoogle Scholar
  • Omari Z. Optimisation des pauses dans le problème de fabrication des horaires avec quarts de travail. (2002) . M.Sc. Thesis, Ecole Polytechnique de Montréal, MontréalGoogle Scholar
  • Quimper C-G, Rousseau L-M. A large neighbourhood search approach to the multi-activity shift scheduling problem. J. Heuristics (2010) 16(3):373–392CrossrefGoogle Scholar
  • Quimper C-G, Walsh T, Bessière C. Decomposing global grammar constraint. Principles and Practice of Constraint Programming—CP 2007 (2007) (Springer-Verlag, Heidelberg) 590–604Lecture Notes in Computer Science, Vol. 4741CrossrefGoogle 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
  • Ritzman L, Krajewski LJ, Showalter MJ. The disaggregation of aggregate manpower plans. Management Sci. (1976) 22(11):1204–1214LinkGoogle Scholar
  • Vatri E. Integration de la génération de quart de travail et de l'attribution d'activités. (2001) . M.Sc. Thesis, Ecole Polytechnique de Montréal, MontréalGoogle 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.