Akdar Alemtabriz; Ashkan Ayough; Mahdie Baniasadi
Abstract
During the recent years, extensive research has been done on the field ofproject scheduling. There is always uncertainty in the area of projectscheduling that causes a deviation in the real plan from the scheduled plan.One of the solutions to deal with this uncertainty is using the critical chainmethod ...
Read More
During the recent years, extensive research has been done on the field ofproject scheduling. There is always uncertainty in the area of projectscheduling that causes a deviation in the real plan from the scheduled plan.One of the solutions to deal with this uncertainty is using the critical chainmethod (CCM) in project scheduling. This method which is derived from thetheory of constraints (TOC) is a new method in project control which was firstproposed by Goldartt in 1997.In this research we attempt to use the principalsof critical chain in resource-constrained project scheduling problem. The maininnovation in this research is presentation of critical chain project schedulingproblem model with consideration of feeding buffer and using float as asupplement for feeding buffer. For this matter, the project scheduling underresources constraints with critical chain approach was first written and itsreliability was evaluated using the Lingo software. In the next step thesolution algorithm of this model was developed using the genetic algorithmand finally different sample issues were investigated. The results of thisresearch show the efficiency of the presented genetic algorithm
Ashkan Ayough; Mostafa Zandyeh; Haide Mottaghi
Volume 6, Issue 16 , June 2007, , Pages 29-54
Abstract
In this paper we develop the concept of boring caused by doing the same jobs to two types of boring, negative or undesirable and positive or desirable, which are felt by operators because of doing similar jobs and not only due to doing the same ones. Based on this new concept, the flexible model has ...
Read More
In this paper we develop the concept of boring caused by doing the same jobs to two types of boring, negative or undesirable and positive or desirable, which are felt by operators because of doing similar jobs and not only due to doing the same ones. Based on this new concept, the flexible model has been proposed by which jobs will be scheduled to minimize the total cost of assignment including the cost of doing the jobs by operators and the boring cost so that job scheduled with respect to their similarities in the smallest time period as well as dissimilarities in the biggest given time period. For the reason that the proposed job rotation scheduling model has a multi-period assignment structure and formulated as an integer non-linear model, it is recognized as a combinatorial optimization problem. So applying the metaheuristic algorithms to overcome the complexity of such a problem is required. We use the genetic and imperialist competitive algorithms to do that and verify their efficiency in comparison to that of Lingo software which solves the small integer nonlinear problems. It is also shown that the quality of imperialist competitive algorithm solutions is better than those of genetic algorithm for the proposed model.
