Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net
المؤلفون المشاركون
Barzegar, Behnam
Motameni, Homayun
Bozorgi, Hossein
المصدر
Journal of Applied Mathematics
العدد
المجلد 2012، العدد 2012 (31 ديسمبر/كانون الأول 2012)، ص ص. 1-20، 20ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2012-08-16
دولة النشر
مصر
عدد الصفحات
20
التخصصات الرئيسية
الملخص EN
Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time.
In flexible job-shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP-hard problems.
The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan.
Different methods and algorithms have been presented for solving this problem.
Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals.
In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN) that is based on gravitational search algorithm (GSA).
In the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm.
The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Barzegar, Behnam& Motameni, Homayun& Bozorgi, Hossein. 2012. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net. Journal of Applied Mathematics،Vol. 2012, no. 2012, pp.1-20.
https://search.emarefa.net/detail/BIM-993462
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Barzegar, Behnam…[et al.]. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net. Journal of Applied Mathematics No. 2012 (2012), pp.1-20.
https://search.emarefa.net/detail/BIM-993462
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Barzegar, Behnam& Motameni, Homayun& Bozorgi, Hossein. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net. Journal of Applied Mathematics. 2012. Vol. 2012, no. 2012, pp.1-20.
https://search.emarefa.net/detail/BIM-993462
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-993462
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر