A multi-objective PSO for job-shop scheduling problems

Expert Systems with Applications

Volumn 37, Issue 2, 2010, Pages 1065-1070

  Sha, D Y ^a   Lin, Hsing Hung ^b  

^a CHUNG HUA UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Job shop scheduling; Multiple objectives; Particle swarm optimization

Indexed keywords

BENCH-MARK PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; EVOLUTIONARY HEURISTICS; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; MAKESPAN; MULTI OBJECTIVE; MULTIPLE OBJECTIVES; OPTIMAL SOLUTIONS; PARTICLE MOVEMENT; PARTICLE POSITION; PARTICLE VELOCITIES; PRODUCTION SYSTEM; SCHEDULING OPTIMIZATION; SEARCH QUALITY; SOLUTION SPACE; TEST RESULTS;

MULTIOBJECTIVE OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 71749092272     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.06.041     Document Type: Article

References (27)

1. Bean J. Genetic algorithms and random keys for sequencing and optimization. Operations Research Society of America (ORSA) Journal on Computing 6 (1994) 154-160
2. Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 11 (1990) 1069-1072
3. Candido M.A.B., Khator S.K., and Barcia R.M. A genetic algorithm based procedure for more realistic job shop scheduling problems. International Journal of Production Research 36 12 (1998) 3437-3457
4. Coello C.A., Plido G.T., and Lechga M.S. Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation 8 3 (2004) 256-278
5. Esquivel S.C., Ferrero S.W., and Gallard R.H. Parameter settings and representations in Pareto-based optimization for job shop scheduling. Cybernetics and Systems: An international Journal 33 (2002) 559-578
6. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
7. Giffler J., and Thompson G.L. Algorithms for solving production scheduling problems. Operations Research 8 (1960) 487-503
8. Gonçalves J.F., Mendes J.J.M., and Resende M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167 1 (2005) 77-95
9. Jain A.S., and Meeran S. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113 (1999) 390-434
10. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks 1995 (pp. 1942-1948).
11. Kobayashi, S., Ono, I. & Yamamura, M. (1995). An efficient genetic algorithm for job shop scheduling problems. In L.J. Eshelman (Ed.), Proceedings of the sixth international conference on genetic algorithms (pp. 506-511). San Francisco, CA: Morgan Kaufman Publishers.
12. Lei D., and Wu Z. Crowding-measure-based multi-objective evolutionary algorithm for job shop scheduling. International Journal of Advanced Manufacturing Technology 30 (2006) 112-117
13. Lei D. A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Computers and Industrial Engineering 54 4 (2008) 960-971
14. Liang Y.C., Ge H.W., Zho Y., Guo X.C., et al. A particle swarm optimization-based algorithm for job-shop scheduling problems. International Journal of Computational Methods 2 3 (2005) 419-430
15. Lourenço H.R. Local optimization and the job-shop scheduling problem. European Journal of Operational Research 83 (1995) 347-364
16. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
17. Pezzella F., and Merelli E. A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research 120 2 (2000) 297-310
18. Ponnambalam S.G., Ramkumar V., and Jawahar N. A multi-objective genetic algorithm for job shop scheduling. Production Planning and Control 12 8 (2001) 764-774
19. Ripon K.S.N. Hybrid evolutionary approach for multi-objective job-shop scheduling problem. Malaysian Journal of Computer Science 20 2 (2007) 183-198
20. Sha D.Y., and Hsu C.-Y. A hybrid particle swarm optimization for job shop scheduling problem. Computers and Industrial Engineering 51 4 (2006) 791-808
21. Sha D.Y., and Hsu C.-Y. A new particle swarm optimization for the open shop scheduling problem. Computers and Operations Research 35 (2008) 3243-3261
22. Sun D., Batta R., and Lin L. Effective job shop scheduling through active chain manipulation. Computers and Operations Research 22 2 (1995) 159-172
23. Suresh R.K., and Mohanasndaram K.M. Pareto archived simulated annealing for job shop scheduling with multiple objectives. International Journal of Advanced Manufacturing Technology 29 (2006) 184-196
24. Taillard E.D. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
25. Wang L., and Zheng D.-Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research 28 (2001) 585-596
26. Xia W., and Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 (2005) 409-425
27. Zhang H., Li X., Li H., and Hang F. Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construction 14 3 (2005) 393-404