Loading...

Project Scheduling Subject to Nonrenewable Resource with Proscheduled Procurement

Shirzadeh Chaleshtari, Ali | 2014

508 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 46037 (06)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Shadrokh, Shahram
  7. Abstract:
  8. Among various types of resources defined in the project scheduling literature, the most studies have been conducted on the renewable and nonrenewable resource types. Definition of different resources in the project scheduling literature is based on the specification of the resources in the real projects. Yet there are some sort of nonrenewable resources in the real projects that are not exactly similar to the type defined in the project scheduling literature. The difference stems from this fact that in the project scheduling literature, it is supposed that the nonrenewable resources required for the execution of the project activities are available in full amount at the beginning of the project. However, in practice, there are many cases that these resources are procured gradually along the project according to some prescheduled procurement plan. These resources have not been introduced and studied specifically by the publication of the research results of this thesis. To conduct the study in question, the framework of the resource constrained project scheduling problem (RCPSP) is used and this problem is extended by adding the constraints for the nonrenewable resources with prescheduled procurement. The extended problem which is abbreviated as RCPSP-NR, has NP-hard complexity. The following studies are conducted on this problem: 1- Introduction of some sub-algorithms applicable and useful in the structure of in-exact solution methods and in some cases, exact solution methods for the problem; 2- Introduction of exact solution algorithms for the problem including four branch and bound and one branch and cut methods; 3- Introduction of a meta-heuristic algorithm based on the genetic algorithm for solving the problem; 4- Introduction of a lower bounding algorithm for the problem based on the Lagrangian relaxation method. For the evaluation of all these methods, comprehensive numerical studies are conducted and the results are analyzed
  9. Keywords:
  10. Project Scheduling ; Genetic Algorithm ; Heuristic Method ; Branch and Bound Method ; Branch and Cut Algorithm ; Nonrenewable Perishable Resources ; Procurement Scheduling ; Lagrangian Relaxation

 Digital Object List

 Bookmark

No TOC