| You are in:Home/Publications/Comparison of Particle Swarm Optimization, Genetic Algorithm and Max Separable Technique for Solving Machine Time Scheduling Problem | |
Prof. Ahmed Abouelyazed Elsawy Ali :: Publications: |
|
| Title: | Comparison of Particle Swarm Optimization, Genetic Algorithm and Max Separable Technique for Solving Machine Time Scheduling Problem |
| Authors: | A. A. El-sawy ; A. A. Tharwat |
| Year: | 2010 |
| Keywords: | Machine Time Scheduling, Particle SWARM optimization, Genetic Algorithm, Max-separable, Time Window. |
| Journal: | International Journal of Computer Information Systems |
| Volume: | 1 |
| Issue: | 3 |
| Pages: | 46-52 |
| Publisher: | Not Available |
| Local/International: | International |
| Paper Link: | Not Available |
| Full paper | Not Available |
| Supplementary materials | Not Available |
| Abstract: |
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. |
