مقالههای B. Afshar Nadjafi
توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقالههای نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده میشوند.
اطلاعات انتشار: Journal of Optimization in Industrial Engineering، سوم،شماره۶، ۲۰۱۰، سال ۰
تعداد صفحات: ۱۲
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resource quantities. We construct a continuous time Markov chain model for the activity network and use the PhaseType distribution to evaluate the project completion time. Then we use Fibonacci search over the interval of permissible allocations to the activity to seek the minimum expected cost.
۲A branch and bound algorithm for the weighted earliness–tardiness project scheduling problem with generalized precedence relations
نویسنده(ها): B. Afshar Nadjafi
اطلاعات انتشار: Scientia Iranica، شانزدهم،شماره۱، ۲۰۰۹، سال ۰
تعداد صفحات: ۱۰
Abstract We present an exact solution procedure for the weighted earliness–tardiness project scheduling problem (WETPSP) with generalized precedence relations (WETPSP–GPR), taking into account time value of money (WETPSPDC–GPR) and a fixed deadline for the project. The WETPSP–GPR extends the WETPSP to arbitrary minimal and maximal time–lags between the starting and completion times of activities. We present a new depth–first branch and bound (B&B) algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows and minimum as well as maximum time–lags between different activities may be given. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported. Keywords: Project scheduling; Branch and bound; Net present value; generalized precedence relations
نمایش نتایج ۱ تا ۲ از میان ۲ نتیجه