Premium
A Useful Theorem in the Dynamic Programing Solution of Sequencing and Scheduling Problems Occurring in Capital Expenditure Planning
Author(s) -
Morin Thomas L.,
Esogbue Augustine M. O.
Publication year - 1974
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/wr010i001p00049
Subject(s) - curse of dimensionality , mathematical optimization , scheduling (production processes) , computer science , job shop scheduling , mathematical economics , mathematics , artificial intelligence , schedule , operating system
The dimensionality of certain sequencing and scheduling problems can be reduced by exploiting their special structures. An example of this type of reduction of dimensionality is presented in the form of a theorem. The use of the theorem in the dynamic programing solution of a previous example is discussed. Sufficient conditions for the optimality of a myopic decision rule are also shown to be a special case of the theorem.