0 - 1 programming approach to solve multiple resource constrained scheduling problems arising in project management by Sachin Nandgaonkar (Student Project)
Material type:
- SP 1993/371
Item type | Current library | Collection | Shelving location | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Student Project | Vikram Sarabhai Library | Reference | Students Project | SP 1993/371 (Browse shelf(Opens below)) | Not for loan | SP000371 |
Submitted to Prof. Trilochan Sastry
In this report, an attempt has been made to review the formulations proposed by various researchers in the light of techniques proposed by Johnson et. al. in solving these problems; the Pritsker's formulation which is widely recognised as a standard formulation has been modified in an attempt to get better results; another alternative formulation has also been proposed, it is expected that this formulation will give much better results with the branch and bound technique applied for solving 0-1 problems.
There are no comments on this title.