Job shop scheduling optimization through multiple independent particle swarms

International Journal of Intelligent Computing and Cybernetics

Volumn 2, Issue 1, 2009, Pages 5-33

  Yen, Gary G ^a   Ivers, Brian ^a  

^a Oklahoma State University   (United States)

Author keywords

Job sequence loading; Production scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTING POWER; DESIGN/METHODOLOGY/APPROACH; DIVIDE AND CONQUER; INFORMATION SHARING; JOB SEQUENCE LOADING; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; META-HEURISTIC METHODS; METAHEURISTIC; MULTIMODAL PROBLEMS; MULTIPLE SWARMS; NEW DESIGN; NP-HARD; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; PARTICLE SWARM; PRODUCTION SCHEDULING; SEARCH SPACES; SIMULATION EXPERIMENTS; SINGLE OBJECTIVE OPTIMIZATION; SOCIAL BEHAVIOR;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FUNCTION EVALUATION; HEURISTIC METHODS; MACHINE DESIGN; OPTICAL COMMUNICATION; PRODUCTION ENGINEERING; SCHEDULING ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 78549239303     PISSN: 1756378X     EISSN: 17563798     Source Type: Journal    
DOI: 10.1108/17563780910939237     Document Type: Article

References (24)

1. Bierwirth, C.A. (1995), “Generalized permutation approach to job shop scheduling with genetic algorithms”, OR Spektrum, Vol. 17, pp. 87-92.
2. Chang, Y.L., Sueyoshi, T. and Sullivan, R.S. (1996), “Ranking dispatching rules by data envelopment analysis in a job-shop environment”, IIE Transactions, Vol. 28 No. 8, pp. 631-42.
3. Davis, L. (1985), “Job shop scheduling with genetic algorithms”, Proceedings of the 1st International Conference on Genetic Algorithms, Pittsburgh, PA, pp. 136-40.
4. Dimopoulos, C. and Zalzala, A. (2000), “Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons”, IEEE Trans. Evolutionary Computation, Vol. 4, pp. 93-113.
5. Eberhard, R.C. and Kennedy, J. (1995), “A new optimizer using particle swarm theory”, Proceedings of the International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39-43.
6. Fenton, P. and Walsh, P. (2005), “Improving the performance of the repeating permutation representation using morphogenic computation and generalized modified order crossover”, The 2005 IEEE Congress on Evolutionary Computation, Vol. 2, pp. 1372-9.
7. Giffler, B. and Thompson, G.L. (1960), “Algorithms for solving production scheduling problems”, Operations Research, Vol. 8 No. 4, pp. 487-503.
8. Jackson, J.R. (1955), “Scheduling a production line to minimize maximum tardiness”, Research Report 43, Management Science Research Projects, University of California, Los Angeles, CA.
9. Jackson, J.R. (1957), “Simulation research on job-shop production”, Naval Research Logistics Quarterly, Vol. 4, pp. 287-95.
10. Jain, A.S. and Meeran, S. (1999), “A state-of-the-art review of job-shop scheduling techniques”, European Journal of Operations Research, Vol. 113, pp. 390-434.
11. Lawrence, S. (1984), “Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques”, Technical Report, Carnegie Mellon University, Pittsburgh, PA.
12. Lian, Z., Gu, X. and Jiao, B. (2005), “A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan”, Applied Mathematics and Computation, Vol. 12, pp. 124-32.
13. Liu, J., Zhong, W. and Jiao, L. (2006), “A multiagent evolutionary algorithm for constraint satisfaction problems”, IEEE Trans. Systems, Man, and Cybernetics – Part B: Cybernetics, Vol. 36, pp. 54-73.
14. Muth, J.F. and Thompson, G.L. (1963), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ.
15. Pang, W., Wang, K., Zhou, C., Dong, L., Liu, M., Zhang, H. and Wang, J. (2004), “Modified particle swarm optimization based on space transformation for solving traveling salesman problem”, Proceedings of the International Conference on Machine Learning and Cybernetics, Shanghai, China, pp. 26-9.
16. Pirlot, M. (1996), “General local search methods”, European Journal of Operational Research, Vol. 92, pp. 493-511.
17. Rowe, A.J. and Jackson, J.R. (1956), “Research problems in production routing and scheduling”, Journal of Industrial Engineering, Vol. 7, pp. 116-21.
18. Smith, W.E. (1956), “Various optimizers for single stage production”, Naval Research Logistics Quarterly, Vol. 3, pp. 59-66.
19. Song, M. and Gu, G. (2004), “Research on particle swarm optimization: a review”, Proceedings of the International Conference on Machine Learning and Cybernetics, Shanghai, China, pp. 30-3.
20. Tasgetiren, M.F., Liang, Y.C., Sevkli, M. and Gencyilmaz, G. (2004a), “Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop problem”, Proceedings of the International Symposium on Intelligent Manufacturing Systems, Sakarya, Turkey, pp. 431-41.
21. Tasgetiren, M.F., Sevkli, M., Liang, Y.C. and Gencyilmaz, G. (2004b), “Particle swarm optimization algorithm for single-machine total weighted tardiness problem”, Proceedings of Congress on Evolutionary Computation, Portland, OR, pp. 19-23.
22. Wang, K., Huang, L., Zhou, C. and Pang, W. (2003), “Particle swarm optimization for traveling salesman problem”, Proceedings of the International Conference on Machine Learning and Cybernetics, Xi'an, China, pp. 2-5.
23. Xia, W. and Wu, Z. (2005), “An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems”, Computers & Industrial Engineering, Vol. 48, pp. 409-25.
24. Xia, W., Wu, Z., Zhang, W. and Yang, G. (2004), “A new hybrid optimization algorithm for the job shop scheduling problem”, Proceedings of the American Control Conference, Boston, MA, pp. 5552-7.