Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs
Pamay, M. Berke and Bülbül, Kerem and Ulusoy, Gündüz (2013) Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs. In: Pulat, Pakize S. and Sarin, Subhash C. and Uzsoy, Reha, (eds.) Essays in Production, Project Planning and Scheduling: A Festschrift in Honor of Salah Elmaghraby. International Series in Operations Research & Management Science. Springer Verlag, Berlin, pp. 219-248. ISBN 1461490553 ; 978-1461490555
This is the latest version of this item.
In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided. In DRCMPSPWET, a project arrives on top of an existing project portfolio and a due date has to be quoted for the new project while minimizing the costs of schedule changes. The objective function consists of the weighted earliness tardiness costs of the activities of the existing projects in the current baseline schedule plus a term that increases linearly with the anticipated completion time of the new project. An iterated local search based approach is developed for large instances of this problem. In order to analyze the performance and behavior of the proposed method, a new multi-project data set is created by controlling the total number of activities, the due date tightness, the due date range, the number of resource types, and the completion time factor in an instance. A series of computational experiments are carried out to test the performance of the local search approach. Exact solutions are provided for the small instances. The results indicate that the local search heuristic performs well in terms of both solution quality and solution time.
Available Versions of this Item
Repository Staff Only: item control page