| Author | Rangaswami, Parthasarathy |
| Call Number | AIT Thesis no.ST-81-14 |
| Subject(s) | Scheduling (Management)--Mathematical models
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | The problem of scheduling activities so t hat none of the resource availabilities are exceeded and none of the precedence relations are
violated is an extremely difficult task for projects of even moderate size . This type of limited resource scheduling problem is what the mathematicians refer to as the combinatorial problem. The number of combinations of possible activity start times is so large even for moderate projects that big computers are unable to tackle the problem. Hence, the attention has shifted to solving such problems through
heuristic methods. These methods, through the aid of heuristic rules, yield solutions very close to optimal solutions. Further attention has been
focussed on developing these heuristic models in such a way as to reduce the gap between the heuristic solutions and the exact optimal solutions. In this study, a mathematical model and a heuristic model have been
proposed, and it is shown that, with some flexibility in the resource constraints, a solution approaching the optimal solution can be achieved. A
computer program has been developed for application to real-life problems. |
| Year | 1981 |
| Type | Thesis |
| School | School of Engineering and Technology |
| Department | Department of Civil and Infrastucture Engineering (DCIE) |
| Academic Program/FoS | Structural Engineering (STE) /Former Name = Structural Engineering and Construction (ST) |
| Chairperson(s) | Loo, Yew-Chaye ; Ping Kunawatsatit
|
| Examination Committee(s) | Jearkjirm, Vithool
|
| Scholarship Donor(s) | The Government of New Zealand |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1981 |