header
Image from OpenLibrary

Using genetic algorithms for flexible job shop scheduling with sequence - dependent setup times / Marwa Mostafa Mostafa Mohamed ; Supervised Ali A. Khattab , Tamer F. Abdelmaguid

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Marwa Mostafa Mostafa Mohamed , 2011Description: 124 P. : charts ; 30cmOther title:
  • استخدام الخوارزمات الجينية لجدولة العمليات فى ورش التصنيع المرنة مع وجود أزمنة تجهيز معتمدة على ترتيب التشغيل [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Mechanical design and Production Summary: 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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.13.M.Sc.2011.Ma.U (Browse shelf(Opens below)) Not for loan 01010110055833000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.13.M.Sc.2011.Ma.U (Browse shelf(Opens below)) 55833.CD Not for loan 01020110055833000

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

Issued also as CD

There are no comments on this title.

to post a comment.