مشخصات پژوهش

عنوان	Transportation equipments constraint in job shop scheduling problems
نوع پژوهش	مقاله ارائه شده کنفرانسی
کلیدواژه‌ها	Flexible job shop scheduling - simulated annealing - Tabu search -Transportation.
چکیده	Transportation system is an important field in the Job Shop scheduling problems. Transportation time considering and accessibility of transportation vehicle such as robots in the job shop scheduling problem make scheduling programs be more realistic and effective. In this paper, we consider transportation equipment constraint in job shop scheduling problem and suggest an effective algorithm to solve this problem. The considered problem is described by a mixed Integer linear programming model. Such the considered problem is known as NP Hard class problem; we will suggest a hybrid Meta heuristic method base on Taboo search and simulated annealing method, to solve this problem. Numerical experiment shows that the developed algorithm is capable to achieve the global solutions for small size problems. It is concluded that the developed algorithm is most effective and efficient to obtain near optimum solutions for medium and large size problems.
پژوهشگران	عبدالرضا روشنی (نفر سوم)، جمال ارکات (نفر دوم)، پرویز فتاحی (نفر اول)