Scheduling the factory pick-up of new cars

Mellentien, Christoph; Schwindt, Christoph; Trautmann, Norbert (2004). Scheduling the factory pick-up of new cars. OR Spectrum, 26(4), pp. 579-601. Springer 10.1007/s00291-004-0174-6

[img] Text
Boris1.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (208kB) | Request a copy

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.

Item Type:

Journal Article (Original Article)

Division/Institute:

03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Trautmann, Norbert

Subjects:

600 Technology > 650 Management & public relations

ISSN:

1436-6304

Publisher:

Springer

Language:

English

Submitter:

Larissa Notz

Date Deposited:

20 May 2014 12:00

Last Modified:

31 Jul 2017 08:20

Publisher DOI:

10.1007/s00291-004-0174-6

BORIS DOI:

10.7892/boris.49078

URI:

https://boris.unibe.ch/id/eprint/49078

Actions (login required)

Edit item Edit item
Provide Feedback