Heuristics for multimode scheduling problems with dedicated resources

We study scheduling problems with multiple modes and dedicated resources arising in production and project management, which constitute a special class of the general multimode resource-constrained project scheduling problem. A task may require simultaneously a set of discrete, renewable resources to be processed and the processing can be performed in different modes, that is with different resource sets, processing times, or costs. Precedence constraints can exist among tasks. The total budget that can be allocated to the project can be limited. The problem consists of identifying a mode for each task and a starting time for its processing respecting precedence, resource, and budget constraints. A graph model and an iterative solution scheme are presented. Specific heuristic algorithms for the cases with and without budget constraints are given and computational results are discussed.

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

[2]  Lucio Bianco,et al.  Scheduling Independent Tasks with Multiple Modes , 1995, Discret. Appl. Math..

[3]  J. We¸Glarz,et al.  ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMS , 1980 .

[4]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .

[5]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

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

[7]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[8]  Lucio Bianco,et al.  Nonpreemptive scheduling of independent tasks with prespecified processor allocations , 1994 .

[9]  Paolo Serafini,et al.  A decomposition approach for a resource constrained scheduling problem , 1994 .

[10]  Carlo Vercellis,et al.  Hierarchical models for multi-project planning and scheduling , 1993 .

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

[12]  Jan Weglarz,et al.  Project Scheduling with Discrete and Continuous Resources , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[15]  Arno Sprecher.  Resource-Constrained Project Scheduling , 1994 .

[16]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[17]  Andreas Drexl,et al.  Scheduling of Project Networks by Job Assignment , 1991 .

[18]  Erik Demeulemeester,et al.  Minimizing resource availability costs in time-limited project networks , 1995 .

[19]  F. F. Boctor.  Heuristics for scheduling projects with resource restrictions and several resource-duration modes , 1993 .