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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Correspondence to: Christoph Mellentien
The authors would like to thank Margit Frank (Porsche AG) and Benjamin Müller (University of Bern) for their valuable contributions to this work.
Rights and permissions
About this article
Cite this article
Mellentien, C., Schwindt, C. & Trautmann, N. Scheduling the factory pick-up of new cars. OR Spectrum 26, 579–601 (2004). https://doi.org/10.1007/s00291-004-0174-6
Issue Date:
DOI: https://doi.org/10.1007/s00291-004-0174-6