Scheduling the factory pick-up of new cars |
| |
Authors: | Christoph Mellentien Christoph Schwindt Norbert Trautmann |
| |
Affiliation: | (1) Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, 76128 Karlsruhe, Germany;(2) Institut für Wirtschaftswissenschaft, Technische Universität Clausthal, 38678 Clausthal-Zellerfeld, Germany |
| |
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.
Correspondence to: Christoph MellentienThe authors would like to thank Margit Frank (Porsche AG) and Benjamin Müller (University of Bern) for their valuable contributions to this work. |
| |
Keywords: | Customer relationship management Factory pick-up Resource-constrained project scheduling Minimum-cost flows |
本文献已被 SpringerLink 等数据库收录! |