Optimal Solution of Resource Constrained Network Scheduling Problems.
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
A class of scheduling problems is defined which are called resource constrained network scheduling problems. Basically, these are problems in which a set of start times for tasks must be determined which minimize some function of the task completion times. The tasks are constrained by a CPM-PERT type precedence network and use specified amounts of various scarce resources. Included in this class of problems is the job shop scheduling problems at which substantial research has been directed. One presents three major ideas for the optimal solution of these problems. In addition, one shows that these ideas may be applied to the resource constrained economic lot size problem and to a computer storage allocation problem. Finally, the use of the group theoretic approach to integer programming for solving scheduling problems is discussed and some problems which arise are mentioned. Author
- Operations Research