Using genetic algorithms for flexible job shop scheduling with sequence - dependent setup times /
Marwa Mostafa Mostafa Mohamed
Using genetic algorithms for flexible job shop scheduling with sequence - dependent setup times / استخدام الخوارزمات الجينية لجدولة العمليات فى ورش التصنيع المرنة مع وجود أزمنة تجهيز معتمدة على ترتيب التشغيل Marwa Mostafa Mostafa Mohamed ; Supervised Ali A. Khattab , Tamer F. Abdelmaguid - Cairo : Marwa Mostafa Mostafa Mohamed , 2011 - 124 P. : charts ; 30cm
Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Mechanical design and Production
In this thesis, the problem of job shop scheduling with alternative machines and sequence - dependent setup times is addressed with the objective of minimizing the maximum completion time for all jobs, know as the makespan . Three genetic algorithm coding schemes from the literature of the JSSP , namely Operation - base ( OB ) representation, Priorty - rule - based ( PR ) representation and random keys ( RK ) representation are applied to the studied problem
FJSP GA GA representation
Using genetic algorithms for flexible job shop scheduling with sequence - dependent setup times / استخدام الخوارزمات الجينية لجدولة العمليات فى ورش التصنيع المرنة مع وجود أزمنة تجهيز معتمدة على ترتيب التشغيل Marwa Mostafa Mostafa Mohamed ; Supervised Ali A. Khattab , Tamer F. Abdelmaguid - Cairo : Marwa Mostafa Mostafa Mohamed , 2011 - 124 P. : charts ; 30cm
Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Mechanical design and Production
In this thesis, the problem of job shop scheduling with alternative machines and sequence - dependent setup times is addressed with the objective of minimizing the maximum completion time for all jobs, know as the makespan . Three genetic algorithm coding schemes from the literature of the JSSP , namely Operation - base ( OB ) representation, Priorty - rule - based ( PR ) representation and random keys ( RK ) representation are applied to the studied problem
FJSP GA GA representation