A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times

European Journal of Operational Research

Volumn 193, Issue 1, 2009, Pages 73-85

  Anghinolfi, Davide ^a   Paolucci, Massimo ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Metaheuristics; Particle swarm optimization; Scheduling

Indexed keywords

CELLULAR AUTOMATA; COMPETITION; INDUSTRIAL ECONOMICS; NUCLEAR PROPULSION; OPTIMIZATION; SCHEDULING;

COHERENT SEQUENCING; DISCRETE MODELING; DISCRETE PARTICLE SWARM OPTIMIZATION; LOCAL SEARCH; METAHEURISTICS; NP-HARD; PARTICLE POSITION; PARTICLE SWARM OPTIMIZATION; SEQUENCE-DEPENDENT SETUP TIMES; SINGLE MACHINES; SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM; SWARM INTELLIGENCE; TOTAL WEIGHTED TARDINESS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 52049112160     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.044     Document Type: Article

References (39)

1. Abraham A., Guo H., and Liu H. Swarm intelligence: Foundations, perspectives and applications. In: Abraham A., Grosan C., and Ramos V. (Eds). Swarm Intelligence in Data Mining. Studies in Computational Intelligence (Series) (2006), Springer-Verlag, Berlin
2. Allahverdi A., and Al-Anzi F.S. A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Computers & Operations Research 33 (2006) 1056-1080
3. Anghinolfi D., and Paolucci M. Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research 34 (2007) 3471-3490
4. Anghinolfi, D., Paolucci, M., in press. A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. International Journal of Operations Research.
5. Bean J.C. Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154-160
6. Chen A., Yang G., and Wu Z. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A 7 (2006) 607-614
7. Cicirello, V.A., 2003. Weighted tardiness scheduling with sequence-dependent setups a benchmark library. Technical Report of Intelligent Coordination and Logistics Laboratory Robotics Institute, Carnegie Mellon University, USA
8. Cicirello, V.A., 2006. Non-wrapping order crossover: An order preserving crossover operator that respects absolute position. In: Proc. of GECCO'06 Conference, Seattle, WA, USA, pp. 1125-1131.
9. Cicirello V.A., and Smith S.F. Enhancing stochastic search performance by value-based randomization of heuristics. Journal of Heuristics 11 (2005) 5-34
10. Clerc M., and Kennedy J. The particle swarm: Explosion, stability, and convergence in a multi-dimensional complex space. IEEE Transactions on Evolutionary Computation 6 (2002) 58-73
11. Clerc M. Discrete Particle Swarm Optimization. In: Onwubolu G.C., and Babu B.V. (Eds). New Optimization Techniques in Engineering (2004), Springer-Verlag, Berlin 219-240
12. Devore J.L. Probability and Statistics for Engineering and the Sciences (1991), Brooks/Cole Publishing Company, Pacific Grove, CA
13. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
14. França P.M., Mendes A., and Moscato P. A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 132 (2001) 224-242
15. Hu X., Eberhart R., and Shi Y. Swarm intelligence for permutation optimization: a case study of n-queens problem. Proceedings of the 2003 IEEE Conference on Swarm Intelligence Symposium (SIS'03) (2003), IEEE Press 243-246
16. Kennedy J., and Eberhart R. Particle Swarm Optimization. Proceeding of the 1995 IEEE International Conference on Neural Network (1995) 1942-1948
17. Kennedy J., and Eberhart R. A discrete binary version of the particle swarm algorithm. Proceedings of the International Conference on Systems, Man and Cybernetics vol. 5 (1997), IEEE Press 4104-4108
18. Kennedy J., and Eberhart R.C. Swarm Intelligence (2001), Morgan Kaufmann, San Francisco
19. Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1997) 331-342
20. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transaction 29 (1997) 45-52
21. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 (2006) 773-785
22. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 183 (2006) 1008-1017
23. Liao C.-J., and Juan H.C. An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research 34 (2007) 1899-1909
24. Liao C.-J., Tseng C.-T., and Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 34 (2007) 3099-3111
25. Lin, S.-W., Ying, K.-C., 2006. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. The International Journal of Advanced Manufacturing Technology. Available from: www.springerlink.com.
26. Liu B., Wang L., and Jin Y.-J. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology (2005)
27. Mladenovic N., and Hansen P. Variable neighbourhood search. Computers & Operations Research 24 (1997) 1097-1100
28. Mohan, C.K., Al-kazemi, B.,2001. Discrete particle swarm optimization. In: Proceedings of the Workshop on Particle Swarm Optimization, Indianapolis
29. Pang W., Wang K.P., Zhou C.G., and Dong L.-J. Fuzzy discrete particle swarm optimization for solving traveling salesman problem. Proceedings of the 4th International Conference on Computer and Information Technology (2004), IEEE CS Press 796-800
30. Parsopoulos, K.E., Vrahatis, M.N., 2004. UPSO: A unified particle swarm optimization scheme. In: Proceedings of ICCMSE 2004 Conference, Vouliagmeni-Kavouri, Greece, pp. 868-873.
31. Parsopoulos K.E., and Vrahatis M.N. Studying the performance of unified particle swarm optimization on the single machine total weighted tardiness problem. Lecture Notes in Artificial Intelligence (LNAI) 4304 (2006) 760-769
32. Pinedo M. Scheduling: Theory, Algorithms, and Systems (1995), Prentice Hall, Englewood Cliffs, NJ
33. Potts C.N., and van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions 23 (1991) 346-354
34. Rubin P.A., and Ragatz G.L. Scheduling in a sequence dependent setup environment with genetic search. Computers & Operations Research 22 (1995) 85-99
35. Sha D.Y., and Hsu C.-Y. A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering 51 (2006) 791-808
36. Tasgetiren M.F., Liang Y.-C., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
37. Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G., 2004. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, Portland, vol. 2, pp. 1412-1419.
38. Wisner J.D., and Siferd S.P. A survey of U.S. Manufacturing Practices in make-to-order machine shops. Production and Inventory Management Journal 36 (1995) 1-7
39. Zhang H., Li H., and Tam C.M. Particle swarm optimization for resource-constrained project scheduling. International Journal of Project Management 24 (2006) 83-92