Shift Scheduling Problem in Same-Day Courier Industry

Published Online:https://doi.org/10.1287/trsc.1090.0293

References

  • Atlason J., Epelman M. A., Henderson S. G. Call center staffing with simulation and cutting plane methods. Ann. Oper. Res. (2004) 127:333–358CrossrefGoogle Scholar
  • Atlason J., Epelman M. A., Henderson S. G. Optimizing call center staffing using simulation and analytic center cutting plane methods. Management Sci. (2008) 54:295–309LinkGoogle Scholar
  • Attanasio A., Bregman J., Ghiani G., Manni E., Zeimpekis V. S., Giaglis G. M., Tarantilis C. D., Minis I. E. Real-time fleet management at eCourier ltd. Dynamic Fleet Management—Concepts, Systems, Algorithms & Case Studies (2007) (Springer, New York) 219–238CrossrefGoogle Scholar
  • Avramidis A. N., L'Ecuyer P. Modeling and simulation of call centers. Proc. 37th Conf. Winter Simulation (2005) Orlando, FL:144–152CrossrefGoogle Scholar
  • Avramidis A. N., Chan W., Gendreau M., L'Ecuyer P., Pisacane O. Optimizing daily agent scheduling in a multiskill call center. Eur. J. Oper. Res. (2009) 200(3):822–832CrossrefGoogle Scholar
  • Canadian Courier & Messenger Association Industry overview. (2004) . Retrieved March 2008, www.canadiancouriers.org/user_files/images/File/Press MediaGoogle Scholar
  • Caprara A., Toth P., Fischetti M. Algorithms for the set covering problem. Ann. Oper. Res. (2000) 98:353–371CrossrefGoogle Scholar
  • Caprara A., Kroon L., Monaci M., Peeters M., Toth P., Barnhart C., Laporte G. Passenger railway optimization. Transportation (2006) (Handbooks in OR & MS, Elsevier Science, North Holland, The Netherlands) 129–187Google Scholar
  • Cathey F. W., Dailey D. J. A prescription for transit arrival/departure prediction using automatic vehicle location data. Transportation Res. Part C: Emerging Technologies (2003) 11:241–264CrossrefGoogle Scholar
  • Fischetti M., Lodi A. Local branching. Math. Programming (2004) 98:23–46CrossrefGoogle Scholar
  • Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2003) 5:79–141LinkGoogle Scholar
  • Gendreau M., Guerten F., Potvin J.-Y., Séguin R. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Res. Part C (2006) 14:157–174CrossrefGoogle Scholar
  • Genta S., Muñoz J. C. On assigning drivers for a home-delivery system on a performance basis. Ann. Oper. Res. (2007) 155:107–117CrossrefGoogle Scholar
  • Ghiani G., Manni E., Quaranta A., Triki C. Anticipatory algorithms for same-day courier dispatching. Transportation Res. Part E (2009) 45:96–106CrossrefGoogle Scholar
  • Glover F. W., Kochenberger G. A.Handbook of Metaheuristics, International Series in Operations Research and Management Science (2003) 57(Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Gopalakrishnan B., Johnson E. L. Airline crew scheduling: State of the art. Ann. Oper. Res. (2005) 140:305–337CrossrefGoogle Scholar
  • Marketing Research for Industry Courier services: UK. (2006) . Retrieved March 2008, www.msi-reports.co.uk/market_research_reports_pdfs/IUK2-5.pdfGoogle Scholar
  • Messenger Courier Association of the Americas A profile of the less than 24 hour delivery industry and its value. (2006) . Retrieved March 2008, www.mcaa.com/pdf/IndustryprofileFINAL_on_LH.pdfGoogle Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1999) (John Wiley and Sons, Inc., New York) Google Scholar
  • Statistics Canada Couriers and local messengers industry. (2007) . Retrieved March 2008, www.statcan.gc.cs/pub/50-002-x/50-002-x2007002-eng.pdfGoogle Scholar
  • Transport Canada Surface transportation policy, “Canadian courier market size, structure and fleet analysis study”. (2001) . Retrieved March 2008, www.tc.ge.ca/pol/en/report/courier2001/final.pdfGoogle 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.