رحیمی فرد، , علی

[ 1 ] - الگوریتم ممتیک برای حل مسئله زمانبندی کار کارگاهی منعطف با امکان ایجاد وقفه در انجام فعالیت‌ها

Flexible job shop scheduling problem )FJSP( is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the ma...