چکیده مقاله
The ow shop scheduling problem is a vital type of scheduling problem with many real world applications This problem is composed of jobs on a set of machines Theobjective is to nd the order of jobs that satisfy some criteria in this research, a parallel ant colony optimization algorithm is proposed to decrease the makespan and completion time Matlab has simulated this method to compare parallel ant colony optimization with the other approaches According to the results, the suggested procedure has higher e ciency than the previous methods
کلیدواژهها
ow-shop scheduling parallel algorithm ow shop scheduling
نویسندگان
Habibeh Nazif
Department of Mathematics, Payame Noor University PNU , Iran
شیوه ارجاع
Nazif, Habibeh,1401,A parallel ant colony optimization algorithm to solve the ow-shop scheduling problem,10th National Conference on Mathematics, Payame Noor University,Shiraz
ارائهشده در
مجموعه مقالات دهمین همایش ملی ریاضی دانشگاه پیام نور28 اردیبهشت 1401 · شیراز