OR Spectrum

, Volume 26, Issue 4, pp 579–601 | Cite as

Scheduling the factory pick-up of new cars

  • Christoph Mellentien
  • Christoph Schwindt
  • Norbert Trautmann

Abstract.

Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the customers’ waiting times is minimized. We show how to model this problem as a resource-constrained project scheduling problem with nonregular objective function, and we present a relaxation-based beam-search solution heuristic. The relaxations are solved by exploiting a duality relationship between temporal scheduling and min-cost network flow problems. This approach has been developed in cooperation with a German automaker. The performance of the heuristic has been evaluated based on practical and randomly generated test instances.

Keywords:

Customer relationship management Factory pick-up Resource-constrained project scheduling Minimum-cost flows 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  • Christoph Mellentien
    • 1
  • Christoph Schwindt
    • 2
  • Norbert Trautmann
    • 1
  1. 1.Institut für Wirtschaftstheorie und Operations ResearchUniversität KarlsruheKarlsruheGermany
  2. 2.Institut für WirtschaftswissenschaftTechnische Universität ClausthalClausthal-ZellerfeldGermany

Personalised recommendations