A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags

Abstract This paper presents an exact model for the multi-mode resource-constrained project scheduling problem with generalized precedence relations in which the minimal or maximal time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the project duration is minimized. Project scheduling of this type occurs in many fields, for instance, construction industries. The proposed model has been inspired by the rectangle packing problems. In spite of the fact that it needs a feasible solution to start for conventional models, the new model has no need for a feasible solution to start. Computational results with a set of 60 test problems have been reported and the efficiency of the proposed model has been analyzed.

[1]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[2]  Salah E. Elmaghraby,et al.  Activity nets: A guided tour through some recent developments , 1995 .

[3]  Arno Sprecher,et al.  Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm , 1998, Eur. J. Oper. Res..

[4]  C. M. Liu,et al.  Vague knowledge search in the design for outsourcing using fuzzy decision tree , 2007, Comput. Oper. Res..

[5]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[6]  Peter Brucker,et al.  A linear programming and constraint propagation-based lower bound for the RCPSP , 2000, Eur. J. Oper. Res..

[7]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows , 2002 .

[8]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998 .

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

[10]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998, Networks.

[11]  Bert De Reyck,et al.  The multi-mode resource-constrained project scheduling problem with generalized precedence relations , 1999, Eur. J. Oper. Res..

[12]  Philippe Baptiste,et al.  Tight LP bounds for resource constrained project scheduling , 2004, OR Spectr..

[13]  Roland Heilmann,et al.  Discrete Optimization A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags , 2002 .

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

[15]  Duanbing Chen,et al.  A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..

[16]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows: From Theory to Applications , 2002 .

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