Using Hybrid Particle Swarm Optimization to solve Machine Time Scheduling Problem with Random Starting Time
The starting time in the machine time scheduling problem will be assumed stochastic follows certain distribution. A hybrid algorithm combines the mutation operation with particle swarm optimization algorithm with constriction factor has been developed to find best starting time for each machine in each cycle when starting time follows normal distribution.
Keywords: Machine Time Scheduling, Particle Swarm optimization, Mutation, Time Window, Normal Distribution
Download Full-Text
ABOUT THE AUTHORS
M. A. Shohla
Faculty of Computers and Information Technology, Taif University Taif, KSA.
A. A. El-Sawy
Faculty of Computers and Information Technology, Taif University Taif, KSA.
M. Nofal
Faculty of Computers and Information Technology, Taif University Taif, KSA.
S. F. El-Zoghdy
Faculty of Computers and Information Technology, Taif University Taif, KSA.
M. A. Shohla
Faculty of Computers and Information Technology, Taif University Taif, KSA.
A. A. El-Sawy
Faculty of Computers and Information Technology, Taif University Taif, KSA.
M. Nofal
Faculty of Computers and Information Technology, Taif University Taif, KSA.
S. F. El-Zoghdy
Faculty of Computers and Information Technology, Taif University Taif, KSA.
