论文信息 - Using Hybrid Particle Swarm Optimization to solve Machine Time Scheduling Problem with Random Starting Time

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.

S. F. El-Zoghdy | M. A. Shohla | A. A. El-sawy | Mostafa Nofal

[1] Narayana Prasad Padhy,et al. Comparison of Particle Swarm Optimization and Genetic Algorithm for TCSC-based Controller Design , 2007 .

[2] Ajith Abraham,et al. Particle Swarm Optimization Using Sobol Mutation , 2008, 2008 First International Conference on Emerging Trends in Engineering and Technology.

[3] Chukwudi Anyakoha,et al. A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.

[4] Sanjo Zlobec,et al. Input optimization: III. optimal realizations of multiobjective models 1 , 1986 .

[5] Lalit M. Patnaik,et al. Genetic algorithms: a survey , 1994, Computer.

[6] A. El-sawy,et al. Comparison of Particle SWARM Optimization, Genetic Algorithm and Max separable Technique for Machine Time Scheduling Problem , 2010 .

[7] Ihab A. El-Khodary,et al. Using Monte Carlo Simulation to Solve Machine Time Scheduling Problems with Stochastic Processing Time , 2003 .

[8] A. Stacey,et al. Particle swarm optimization with combined mutation and hill climbing , 2008 .

[9] Sanjo Zlobec,et al. Input optimization: I. Optimal realizations of mathematical models , 1985, Math. Program..