[Home ]   [ فارسی ]  
Main Menu
Degree Programs::
News & Events::
Photo Gallery::
Contact ::
Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
Last site contents
:: IUST faculty member nominated in the Islamic World Science Citation Index
Last contents of other sections
:: School overview
:: IEEE Smart Grid Conference 2014 italy
:: Smard Grid Conference 2014
:: Memorandum of Islamic Architecture Faculty establishment
:: Center for architectural studies
Contact US
Address : Iran University of Science & Technology -
 Tehran – Iran


Tel : +98(21) 73225000-1

Fax : +98(21) 73021214

E_mail: ie_info AT iust.ac.ir



:: Doctorate Defense ::


      Resource Allocation in a Multi-Project System under Stochastic and Dynamic Conditions

  Advisor: Dr. Noori

  Co- Advisors: Dr. Mahdavi- Dr. Tavakouli Moghadam

  Internal Committee Members: Dr.Bagherpour, Dr.Jalali

  External Committee Members: Dr. Tahsiri, Dr. Rabbani




  In this thesis, the resource allocation problem in dynamic PERT networks is modeled in various cases: dynamic PERT networks with finite capacity of concurrent projects (C o nstant Number of Projects In Process (CONPIP)), multi-class dynamic PERT networks with finite capacity, multi-server dynamic PERT networks with infinite capacity, multi-class dynamic PERT networks with infinite capacity. Moreover, the reactive resource allocation problem in dynamic PERT networks is also studied. In this research, it is assumed that the new projects are generated according to a Poisson process and activity durations are independent random variables with exponential distributions. Such system can be represented as a queuing network, where each activity of a project is performed at a devoted service station with only one server located in a node of the network.

  For modeling dynamic PERT networks in all cases, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created to solve and find the completion time distribution for any particular project. Then, we propose a multi-objective model with conflict objectives to optimally control the resources allocated to the servers in all cases. It is impossible to solve these multi-objective continuous-time models optimally and consequently we apply metaheuristic models such as: particle swarm optimization (PSO) approach and simulated annealing (SA) algorithm, and also discrete-time approximation method to solve these, using a goal attainment technique.


  Keywords: Multi-project System, Dynamic PERT network; Queueing network; Markov processes; Multiple objective programming





View: 8345 Time(s)   |   Print: 1707 Time(s)   |   Email: 96 Time(s)   |   0 Comment(s)

Related topics Related topics Print version Print version Send to friends Send to friends

کلیه حقوق مادی و معنوی این سایت متعلق به دانشکده مهندسی صنایع دانشگاه علم و صنعت ایران می‌باشد. نقل هرگونه مطلب با ذکر منبع بلامانع می‌باشد.

Persian site map - English site map - Created in 0.7 seconds with 51 queries by YEKTAWEB 4642