This paper discusses dynamic methods for solving a class of multi-project scheduling problems in which rates of job performances are controllable and resources such as money, energy or manpower per time unit, are renewable and continuously divisible. The objective is to complete the projects as close to the common due date as possible. Two different ways of imposing sequential precedence relations between project jobs are explored by formulating two dynamic models and studying their relationships on the optimal solution. Efficient time-decomposition algorithms for finding either globally optimal schedules or lower bound guided near-optimal solutions are suggested and computationally tested.
|Original language||American English|
|Journal||Discrete Event Dynamic Systems|
|State||Published - 1998|