In this paper a branch-and-bound procedure is described for schedulingproject activities subject to precedence diagramming type of precedence relations, ready times, due dates, and variable multiple resource availabi...
详细信息
In this paper a branch-and-bound procedure is described for schedulingproject activities subject to precedence diagramming type of precedence relations, ready times, due dates, and variable multiple resource availability constraints, where the objective is to minimize project duration. The procedure is based on a depth-first solution strategy in which nodes in the solution tree represent resource and precedence feasible partial schedules. Branches emanating from a parent node correspond to exhaustive and minimal combinations of activities, the delay of which resolves resource conflicts at each parent node. A precedence based lower bound and several dominance rules are introduced in order to restrict the growth of the solutions tree. The procedure has been programmed in the C language. Extensive computational experience is reported.
Most of the real life scheduling problems include several constraints in addition to the precedence and resource constraints considered in the resource-constrainedprojectscheduling problem (RCPSP). In this paper, we...
详细信息
Most of the real life scheduling problems include several constraints in addition to the precedence and resource constraints considered in the resource-constrainedprojectscheduling problem (RCPSP). In this paper, we define a generalization of the (RCPSP) with a wide class of additional constraints, including (but not limited to): a pair of activities must be separated by at least a given duration;a subset of activities cannot be processed simultaneously;an activity cannot start before a particular period;an activity cannot be scheduled in a particular time window;there are resource constraints with varying required and available quantities. We show that for this generalization the activity list and the activity set list representations can be used as efficiently as in the (RCPSP) and that by using these representations the optimal Solution can always be reached. This allows most of the known solution procedures for (RCPSP) based on these representations to be extended for the generalized (RCPSP) by simply replacing the classical decoding procedure used for the (RCPSP) with the generalized version introduced here. (C) 2008 Elsevier B.V. All rights reserved.
The objective of this paper is to demonstrate how modelling ideas and solution procedures, borrowed from the field of generalized resource-constrained project scheduling, can be used to formulate and solve several typ...
详细信息
The objective of this paper is to demonstrate how modelling ideas and solution procedures, borrowed from the field of generalized resource-constrained project scheduling, can be used to formulate and solve several types of production scheduling problems involving sequence-independent setup times as well as process and transfer batches. The computational results provide useful insight in the trade-offs that do exist between the computational effort required and the size of the process and transfer batches used.
暂无评论