Branch-and-Price for Personalized Multiactivity Tour Scheduling

References

• Al-Yakoob SM, Sherali HD (2008) A column generation approach for an employee scheduling problem with multiple shifts and work locations. J. Oper. Res. Soc. 59(1):34–43.Crossref, Google Scholar
• Aykin T (1996) Optimal shift scheduling with multiple break windows. Management Sci. 42(4):591–602.Link, Google Scholar
• Bailey J (1985) Integrated days off and shift personnel scheduling. Comput. Indust. Engrg. 9(4):395–404.Crossref, Google Scholar
• Baker KR (1976) Workforce allocation in cyclical scheduling problems: A survey. Oper. Res. Quart. 27(1):155–167.Crossref, Google Scholar
• Bechtold SE, Jacobs LW (1990) Implicit modeling of flexible break assignments in optimal shift scheduling. Management Sci. 36(11):1339–1351.Link, Google Scholar
• Boyer V, Gendron B, Rousseau L-M (2012) A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Scheduling 17(2):185–197.Crossref, Google Scholar
• Brunner JO, Bard JF (2013) Flexible weekly tour scheduling for postal service workers using a branch and price. J. Scheduling 16(1):129–149.Crossref, Google Scholar
• Brunner JO, Stolletz R (2014) Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling. Comput. Oper. Res. 44:137–145.Crossref, Google Scholar
• Brusco MJ, Jacobs LW (2000) Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Sci. 46(12):1630–1641.Link, Google Scholar
• Brusco MJ, Johns TR (2011) An integrated approach to shift-starting time selection and tour-schedule construction. J. Oper. Res. Soc. 62(7):1357–1364.Crossref, Google Scholar
• Çezik T, Günlük O, Luss H (2001) An integer programming model for the weekly tour scheduling problem. Naval Res. Logist. 48(7):607–624.Crossref, Google Scholar
• Côté M-C, Gendron B, Rousseau L-M (2007) Modeling the regular constraint with integer programming. Van Hentenryck P, Wolsey L, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer-Verlag, Berlin), 29–43.Crossref, Google Scholar
• Côté M-C, Gendron B, Rousseau L-M (2011b) Grammar-based integer programming models for multiactivity shift scheduling. Management Sci. 57(1):151–163.Link, Google Scholar
• Côté M-C, Gendron B, Rousseau L-M (2013) Grammar-based column generation for personalized multi-activity shift scheduling. INFORMS J. Comput. 25(3):461–474.Link, Google Scholar
• Côté M-C, Gendron B, Quimper C-G, Rousseau L-M (2011a) Formal languages for integer programming modeling of shift scheduling problems. Constraints 16(1):54–76.Crossref, Google Scholar
• Crainic TG, Frangioni A, Gendron B (2009) OOBB: An object-oriented library for parallel branch-and-bound. CORS/INFORMS Internat. Conf., Toronto, Canada.Google Scholar
• Dahmen S, Rekik M (2015) Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic. J. Scheduling 18(2):207–223.Crossref, Google Scholar
• Dantzig GB (1954) A comment on Edie’s “traffic delays at toll booths”. J. Oper. Res. Soc. America 2(3):339–341.Link, Google Scholar
• Demassey S, Pesant G, Rousseau L-M (2006) A cost-regular based hybrid column generation approach. Constraints 11(4):315–333.Crossref, Google Scholar
• Detienne B, Péridy L, Pinson É, Rivreau D (2009) Cut generation for an employee timetabling problem. Eur. J. Oper. Res. 197(3):1178–1184.Crossref, Google Scholar
• Elahipanah M, Desaulniers G, Lacasse-Guay E (2013) A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts. J. Scheduling 16(5):443–460.Crossref, Google Scholar
• Geoffrion AM (1974) Lagrangean Relaxation for Integer Programming (Springer-Verlag, Berlin).Crossref, Google Scholar
• Jacobs LW, Brusco MJ (1996) Overlapping start-time bands in implicit tour scheduling. Management Sci. 42(9):1247–1259.Link, Google Scholar
• Jarrah AIZ, Bard JF, deSilva AH (1994) Solving large-scale tour scheduling problems. Management Sci. 40(9):1124–1144.Link, Google Scholar
• Kadioglu S, Sellmann M (2008) Efficient context-free grammar constraints. Proc. 23rd AAAI Conf. Artificial Intelligence, Chicago, 310–316.Google Scholar
• Kadioglu S, Sellmann M (2010) Grammar constraints. Constraints 15(1):117–144.Crossref, Google Scholar
• Lequy Q, Bouchard M, Desaulniers G, Soumis F, Tachefine B (2012) Assigning multiple activities to work shifts. J. Scheduling 15(2):239–251.Crossref, Google Scholar
• Mehrotra A, Murphy KE, Trick MA (2000) Optimal shift scheduling: A branch-and-price approach. Naval Res. Logist. 47(3):185–200.Crossref, Google Scholar
• Moondra S (1976) A linear programming model for work force scheduling for banks. J. Bank Res. 6:299–301.Google Scholar
• Morris JG, Showalter MJ (1983) Simple approaches to shift, days-off and tour scheduling problems. Management Sci. 29(8):942–950.Link, Google Scholar
• Ni H, Abeledo H (2007) A branch-and-price approach for large-scale employee tour scheduling problems. Ann. Oper. Res. 155(1):167–176.Crossref, Google Scholar
• Pesant G (2004) A regular language membership constraint for finite sequences of variables. Wallace M, ed. Principles and Practice of Constraint Programming–CP 2004 (Springer, Berlin), 482–495.Crossref, Google Scholar
• Pesant G, Quimper C-G, Rousseau L-M, Sellmann M (2009) The polytope of context-free grammar constraints. van Hoeve W-J, Hooker JN, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer-Verlag, Berlin), 223–232.Crossref, Google Scholar
• Quimper C-G, Rousseau L-M (2010) A large neighbourhood search approach to the multi-activity shift scheduling problem. J. Heuristics 16(3):373–392.Crossref, Google Scholar
• Quimper C-G, Walsh T (2006) Global grammar constraints. Benhamou F, ed. Principles and Practice of Constraint Programming–CP 2006 (Springer, Berlin), 751–755.Crossref, Google Scholar
• Quimper C-G, Walsh T (2007) Decomposing global grammar constraints. Bessiere C, ed. Principles and Practice of Constraint Programming–CP 2007 (Springer-Verlag, Berlin), 590–604.Crossref, Google Scholar
• Rekik M, Cordeau J-F, Soumis F (2004) Using Benders decomposition to implicitly model tour scheduling. Ann. Oper. Res. 128(1–4):113–133.Crossref, Google Scholar
• Rekik M, Cordeau J-F, Soumis F (2010) Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Scheduling 13(1):49–75.Crossref, Google Scholar
• Restrepo MI, Lozano L, Medaglia AL (2012) Constrained network-based column generation for the multi-activity shift scheduling problem. Internat. J. Production Econom. 140(1):466–472.Crossref, Google Scholar
• Ritzman LP, Krajewski LJ, Showalter MJ (1976) The disaggregation of aggregate manpower plans. Management Sci. 22(11):1204–1214.Link, Google Scholar
• Sellmann M (2006) The theory of grammar constraints. Benhamou F, ed. Principles and Practice of Constraint Programming–CP 2006 (Springer, Berlin), 530–544.Crossref, Google Scholar
• Van den Bergh J, Beliën J, De Bruecker P, Demeulemeester E, De Boeck L (2012) Personnel scheduling: A literature review. Eur. J. Oper. Res. 226(3):367–385.Crossref, Google Scholar