Dynamic Resource Constrained Multi-Project Scheduling Problem with Weighted Earliness/Tardiness Costs

In this study, a conceptual framework is given for the dynamic resource-constrained 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 (LS)-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 LS approach. Exact solutions are provided for small instances. The results indicate that the LS heuristic performs well in terms of both solution quality and solution time.

[1]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[2]  Norbert Trautmann,et al.  An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem , 2008 .

[3]  Erik Demeulemeester,et al.  An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem , 2001, Ann. Oper. Res..

[4]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

[5]  Kerem Bülbül,et al.  A linear programming-based method for job shop scheduling , 2012, Journal of Scheduling.

[6]  Willy Herroelen,et al.  Dynamic order acceptance and capacity planning on a single bottleneck resource , 2007 .

[7]  Ramón Alvarez-Valdés Olaguíbel,et al.  Chapter 5 – HEURISTIC ALGORITHMS FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING: A REVIEW AND AN EMPIRICAL ANALYSIS , 1989 .

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[10]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[11]  Mehmet Berke Pamay.  A linear programming based method for the resource constrained multi-project scheduling problem with weighted earliness/tardiness costs , 2011 .

[12]  Adedeji B. Badiru and P. Simin Pulat..  Comprehensive project management , 2015 .

[13]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[14]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[15]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[16]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[17]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[18]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[19]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[20]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[21]  Mario Vanhoucke,et al.  Optimal due date assignment in project scheduling , 2002 .

[22]  Chee-Chuong Sum,et al.  An evaluation of due date, resource allocation, project release, and activity scheduling rules in a multiproject environment , 1997 .

[23]  Toshihide Ibaraki,et al.  A Metaheuristic Approach to the Resource Constrained Project Scheduling with Variable Activity Durations and Convex Cost Functions , 2006 .

[24]  John H Payne,et al.  Management of multiple simultaneous projects: a state-of-the-art review , 1995 .

[25]  Marcos Singer,et al.  Decomposition methods for large job shops , 2001, Comput. Oper. Res..

[26]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[27]  Roel Leus,et al.  New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing , 2011, J. Sched..

[28]  Christian Artigues,et al.  A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..

[29]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[30]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.