Hybrid Particle SWARM Optimization for Solving Machine Time Scheduling Problem
International Journal of Computer and Information Technology • 2013
Publication Information
Authors
A. A. El-sawy; A. A. Tharwat
Keywords
Machine Time Scheduling, Particle SWARM optimization, Genetic Algorithm, Mutation, Crossover, Time Window
Journal
International Journal of Computer and Information Technology
Publisher
Not Available
Volume
02
Issue
03
Pages
364-375
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
A hybrid particle swarm optimization (PSO) for multi-machine time scheduling problem (MTSP) with multicycles is proposed in this paper to choose the best starting time for each machine in each cycle under pre-described time window and a set of precedence machines for each machine; to minimize the total penalty cost. We developed hybrid algorithm by using a combination between PSO and Genetic Algorithms (GA), precisely the GA operators’ crossover and mutation. Based on experimental results for the developed hybrid algorithms, we can conclude that, the algorithm that combines PSO with mutation gives best solution for MTSP.
Staff Members - Benha University