أعضاء هيئة التدريس - جامعة بنها
Comparison of Particle Swarm Optimization, Genetic Algorithm and Max Separable Technique for Solving Machine Time Scheduling Problem
International Journal of Computer Information Systems • 2010
معلومات البحث
المؤلفون
A. A. El-sawy ; A. A. Tharwat
الكلمات المفتاحية
Machine Time Scheduling, Particle SWARM optimization, Genetic Algorithm, Max-separable, Time Window.
المجلة العلمية
International Journal of Computer Information Systems
الناشر
Not Available
المجلد
1
العدد
3
الصفحات
46-52
publication.type
International
رابط البحث
Not Available
المواد المرفقة
Not Available
الملخص
In this paper we deal with a multi cycle machine time scheduling problem (MTSP) to find the best starting time for each machine in each cycle. We introduce an algorithm by using the particle SWARM optimization to solve MTSP called PSOMTSP and we will
introduce another algorithm by using Genetic algorithm to solve the MTSP called GA-MTSP. A comparison between PSO-MTSP, GA-MTSP and MS-MTSP (an algorithm solve MTSP by max-separable technique) will be introduced to find the best solution which is the best starting time respect to its time window for each machine in each cycle and respect to the set of precedence machines to minimize the penalty cost.
introduce another algorithm by using Genetic algorithm to solve the MTSP called GA-MTSP. A comparison between PSO-MTSP, GA-MTSP and MS-MTSP (an algorithm solve MTSP by max-separable technique) will be introduced to find the best solution which is the best starting time respect to its time window for each machine in each cycle and respect to the set of precedence machines to minimize the penalty cost.