فهرس المقالات Constrained resource

• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  1 - Constrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random ‎Times
  N. Akhoundi Shiviyari S. S. Hashemin
  In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.T أکثر

  In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the project. تفاصيل المقالة
• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  2 - Splittable stochastic project scheduling with constrained renewable resource
  S.S Hashemin S.M.T Fatemi Ghomi
  This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrain أکثر

  This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The activity duration time is assumed to be a dis-crete random variable with arbitrary experimental distribution. Solving stochastic mathematical programming model of problem is very hard. So, here some existing methods for deterministic problems have been gener-alized for stochastic case. Solutions of generalized methods are relatively better than random solutions. How-ever, the authors developed the new algorithm that may improve the solutions of generalized methods and project Completion Time Distribution Function (CTDF). Comparison of solution of a method with random solutions is a common assessment method in literature research. Hence, the efficiency of the proposed algo-rithm represented using this method. تفاصيل المقالة