Time-constrained project scheduling with adjacent resources

We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by job groups. As soon as a job of such a group starts, the adjacent resource units are occupied, and they are not released before all jobs of that group are completed. The developed decomposition method separates the adjacent resource assignment from the rest of the scheduling problem. Test results demonstrate the applicability of the decomposition method. The presented decomposition forms a first promising approach for the TCPSP with adjacent resources and may form a good basis to develop more elaborated methods.

[1]  Cees Duin,et al.  On the Complexity of Adjacent Resource Scheduling , 2006, J. Sched..

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

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

[4]  Ronald De Boer.  Resource-constrained multi-project management, a hierarchical decision support system , 1998 .

[5]  Sönke Hartmann,et al.  Packing problems and project scheduling models: an integrating perspective , 2000, J. Oper. Res. Soc..

[6]  Richard F. Deckro,et al.  Resource constrained project crashing , 1989 .

[7]  R. Kolisch,et al.  Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints , 2000 .

[8]  Klaus Neumann,et al.  Project scheduling with inventory constraints , 2003, Math. Methods Oper. Res..

[9]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[10]  Marco Platzner,et al.  Operating systems for reconfigurable embedded platforms: online scheduling of real-time tasks , 2004, IEEE Transactions on Computers.

[11]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[12]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[13]  Johann Hurink,et al.  Time-constrained project scheduling , 2008, J. Sched..

[14]  Christian Artigues,et al.  LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search , 2004, Ann. Oper. Res..

[15]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[16]  Rainer Kolisch,et al.  Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies , 2000 .

[17]  J. Christopher Beck.  Heuristics for scheduling with inventory: dynamic focus via constraint criticality , 2002 .

[18]  Jürgen Teich,et al.  Higher-Dimensional Packing with Order Constraints , 2001, SIAM J. Discret. Math..

[19]  Rolf H. Möhring,et al.  Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..