چکیده مقاله
In this paper, single processors jobshop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm The objective function is to minimize the makespan, i e total completion time, in which a simultanous presence of various kinds of ferons is allowed The process of finding the best solution will be improved by using the suitable hybrid of priority dispatching rules Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also decreases the total working time because of decreasing in setup times and modifying the working production line By solving some problems as samples i e Fisher,s & Tomson,s problems , this algorithm is compared with the others The results show that when the size of the problem becomes lorger, the deviation from lower limit increases, but its rate decreases with the size of the problems, so that it reaches to its limit
کلیدواژهها
نویسندگان
Ramezanali Mahdavinejad
Assistant Prof , Mechanical Engineering Dept ,Engineering Faculty, University ofTehran,Tehran,Iran
شیوه ارجاع
Mahdavinejad, Ramezanali,1384,A New Approach to Job shop- Scheduling Problem,01st Tehran International Congress on Manufacturing Engineering (TICME2005),Tehran
ارائهشده در
مجموعه مقالات اولین کنفرانس بین المللی و هفتمین کنفرانس ملی مهندسی ساخت و تولید1 فروردین 1384 · تهران