ASAP: The After-Salesman Problem

Published Online:https://doi.org/10.1287/msom.1100.0292

References

  • ANWB Klanttevredenheidsonderzoek, Kwartaalrapportages 2003. (2003) (Confidential Publication)Google Scholar
  • Beaumont N. Scheduling staffing using mixed integer programming. Eur. J. Oper. Res. (1997) 98:473–484CrossrefGoogle Scholar
  • Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39(4):601–615LinkGoogle Scholar
  • Bertsimas D. J., van Ryzin G. Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Adv. Appl. Probab. (1993a) 25(4):947–978CrossrefGoogle Scholar
  • Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidan plane with multiple capacitated vehicles. Oper. Res. (1993b) 41(1):60–76LinkGoogle Scholar
  • Brady M. K., Cronin J. J. Some new thoughts on conceptualizing perceived service quality: A hierarchical approach. J. Marketing (2001) 65:34–49CrossrefGoogle Scholar
  • Collier D. A., Wilson D. D. The role of automation and labor in determining customer satisfaction in a telephone repair service process. Decision Sci. (1997) 28(3):689–708CrossrefGoogle Scholar
  • Davis M. M., Heineke J. How disconfirmation and actual waiting times impact customer satisfaction. Internat. J. Service Indust. Management (1998) 9(1):64–73CrossrefGoogle Scholar
  • Ernst A. T., Jiang H., Krishnamoorty M., Sier D. Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. (2004) 153:3–27CrossrefGoogle Scholar
  • Gendreau M., Potvin J.-Y., Crainic T. G., Laporte L. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Norwell, MA) 115–126CrossrefGoogle Scholar
  • Gronroos C. From scientific management to service management. Internat. J. Service Indust. Management (1994) 5(1):5–20CrossrefGoogle Scholar
  • Grotschel M., Krumke S., Rambau J., Winter T., Zimmermann U. Combinatorial on line optimization in real time. (2001) . Technical Report 01-16, Konrad Zuse Zentrum für Informationstechnik BerlinGoogle Scholar
  • Gummesson E. The new marketing-developing long term interactive relationships. Long Range Planning (1987) 20(4):10–20CrossrefGoogle Scholar
  • Hiller B., Krumke S. O., Rambau J. Reoptimization gaps versus model errors in online-dispatching of service units for ADAC. Discrete Appl. Math. (2006) 154:1897–1907CrossrefGoogle Scholar
  • Hvattum L. M., Lokketangen A., Laporte G. Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. (2006) 40(4):421–438LinkGoogle Scholar
  • Hvattum L. M., Lokketangen A., Laporte G. A branch and regret heuristic for stochastic and dynamic vehicle routing problems. Networks (2007) 49(4):330–340CrossrefGoogle Scholar
  • Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34(4):426–438LinkGoogle Scholar
  • Ichoua S., Gendreau M., Potvin J.-Y. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40(2):211–225LinkGoogle Scholar
  • Irani S., Regan A. C., Lu X. On line Algorithms for the dynamic traveling repair problem. (2001) . Report Institute of Transportation Studies, University of California, IrvineGoogle Scholar
  • Johnson D. S. A theoretician's guide to the experimental analysis of algorithms. (2001) . AT&T Labs Research, http://www.research.att.com/dsj/Google Scholar
  • Johnston R. The determinants of service quality: Satisfiers and dissatisfiers. Internat. J. Service Indust. Management (1995) 5(5):53–71CrossrefGoogle Scholar
  • Kaplan R. S., Norton D. P. The balanced scorecard—Measures that drive performance. Harvard Bus. Rev. (1992) 70(1):71–79Google Scholar
  • Krumke S. O., Rambau J., Torres L. M. Real-time dispatching of guided and unguided automobile service units with soft time windows. Lecture Notes in Computer Science (2002a) 2461(Springer, Berlin) 417–424CrossrefGoogle Scholar
  • Krumke S. O., Rambau J., Torres L. M. Online dispatching of automobile service units. (2002b) . Report 02-044, ZIB BerlinGoogle Scholar
  • Krumke S., Laura L., Lipmann M., Marchetti-Spaccamela A., de Paepe W. E., Poensgen R., Stougie L. Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. Lecture Notes in Computer Science (2002c) 2462(Springer, Berlin) 200–214Google Scholar
  • Larsen A., Madsen O. B. G., Solomon M. M. The a priori dynamic traveling salesman problem with time windows. Transportation Sci. (2004) 38(4):459–472LinkGoogle Scholar
  • Lu X., Regan A. C., Irani S. An asymptotically optimal algorithm for the dynamic traveling repair problem. (2002) . Report Institute of Transportation Studies, University of California, IrvineGoogle Scholar
  • Parasuraman A., Zeithaml V. A., Berry L. L. A conceptual model of service quality and its implications for future research. J. Marketing (1985) 49:41–50CrossrefGoogle Scholar
  • Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164CrossrefGoogle Scholar
  • van Huigenbosch P., van de Klundert J., Wormer L. ANWB automates and improves repair men dispatching. (2008) . Working paper, Faculty of Economics and Business Administration, Maastricht University, Maastricht, The NetherlandsGoogle Scholar
  • van de Klundert J., Otten B. Models and heuristics for dynamic revenue optimization in road transport. (2007) . Research Memorandum, Faculty of Ecnomics & Business Administration, Maastricht University, Maastricht, The NetherlandsGoogle Scholar
  • Wormer L. On-line toewijzen van auto-reparatiediensten. (2005) . Master Thesis (In Dutch), Maastricht University, Maastricht, The NetherlandsGoogle 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.