A particle swarm optimization algorithm based on local perturbations for the job shop scheduling problem

International Journal of Advancements in Computing Technology

Volumn 3, Issue 4, 2011, Pages 256-264

  Zhang, Rui ^a  

^a NANCHANG UNIVERSITY   (China)

Author keywords

Job shop scheduling; Local search; Particle swarm optimization

Indexed keywords

COMPETITIVE MARKETS; COMPLETION TIME; COMPUTATIONAL EXPERIMENT; CONTEMPORARY MANUFACTURING; DECISION PROCESS; DUE DATES; HIGH-QUALITY SOLUTIONS; HYBRID PSO; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LOCAL PERTURBATION; LOCAL SEARCH; MAKESPAN; PARTICLE SWARM; PARTICLE SWARM OPTIMIZATION ALGORITHM; PROCESSING TIME; SERVICE REPUTATION; TEST INSTANCES; TOTAL-WEIGHTED TARDINESS;

SCHEDULING ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 79961061202     PISSN: 20058039     EISSN: None     Source Type: Journal    
DOI: 10.4156/ijact.vol3.issue4.28     Document Type: Article

References (22)

1. J. K. Lenstra, A. H. G. R. Kan, and P. Brucker, "Complexity of machine scheduling problems," Annals of Discrete Mathematics, vol. 1, pp. 343-362, 1977.
2. C. Song, X. Liu, W. Wang et al., "Dynamic Integrated Algorithm for Production Scheduling Based on Iterative Search," Journal of Convergence Information Technology, vol. 5, no. 10, pp. 159-166, 2010.
3. R. Zhang, and C. Wu, "A hybrid immune simulated annealing algorithm for the job shop scheduling problem," Applied Soft Computing, vol. 10, no. 1, pp. 79-89, 2010.
4. L. De Giovanni, and F. Pezzella, "An improved genetic algorithm for the distributed and flexible job-shop scheduling problem," European Journal of Operational Research, vol. 200, no. 2, pp. 395-408, 2010.
5. C. R. Vela, R. Varela, and M. A. González, "Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times" Journal of Heuristics, vol. 16, no. 2, pp. 139-165, 2010.
6. L. Sun, X. Cheng, and Y. Liang, "Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function," International Journal of Intelligent Information Processing, vol. 1, no. 2, pp. 65-77, 2010.
7. R. Zhang, and C. Wu, "A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem," Engineering Optimization, vol. 42, no. 7, pp. 641-670, 2010.
8. D. Y. Sha, and C. Y. Hsu, "A hybrid particle swarm optimization for job shop scheduling problem," Computers & Industrial Engineering, vol. 51, no. 4, pp. 791-808, 2006.
9. B. Fox, W. Xiang, and H. P. Lee, "Industrial applications of the ant colony optimization algorithm," The International Journal of Advanced Manufacturing Technology, vol. 31, no. 7-8, pp. 805-814, 2007.
10. M. L. Pinedo, Scheduling: Theory, Algorithms and Systems, 3 ed., New York: Springer, 2008.
11. M. Singer, and M. Pinedo, "A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops," IIE Transactions, vol. 30, no. 2, pp. 109-118, 1998.
12. S. J. Mason, J. W. Fowler, and W. M. Carlyle, "A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops," Journal of Scheduling, vol. 5, no. 3, pp. 247-262, 2002.
13. L. Mönch, and R. Drießel, "A distributed shifting bottleneck heuristic for complex job shops," Computers & Industrial Engineering, vol. 49, no. 3, pp. 363-380, 2005.
14. H. Zhou, W. Cheung, and L. C. Leung, "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, vol. 194, no. 3, pp. 637-649, 2009.
15. I. Essafi, Y. Mati, and S. Dauzère-Pérès, "A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem," Computers & Operations Research, vol. 35, no. 8, pp. 2599-2616, 2008.
16. K. M. J. Bontridder, "Minimizing total weighted tardiness in a generalized job shop," Journal of Scheduling, vol. 8, no. 6, pp. 479-496, 2005.
17. R. Tavakkoli-Moghaddam, M. Khalili, and B. Naderi, "A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness," Soft Computing, vol. 13, no. 10, pp. 995-1006, 2009.
18. A. S. Jain, and S. Meeran, "Deterministic job-shop scheduling: past, present and future," European Journal of Operational Research, vol. 113, no. 2, pp. 390-434, 1999.
19. A. Banks, J. Vincent, and C. Anyakoha, "A review of particle swarm optimization. Part I: background and development," Natural Computing, vol. 6, no. 4, pp. 467-484, 2007.
20. A. Banks, J. Vincent, and C. Anyakoha, "A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications," Natural Computing, vol. 7, no. 1, pp. 109-124, 2008.
21. M. F. Tasgetiren, Y. C. Liang, M. Sevkli et al., "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, vol. 177, no. 3, pp. 1930-1947, 2007.
22. W. Xia, and Z. Wu, "A hybrid particle swarm optimization approach for the job-shop scheduling problem," The International Journal of Advanced Manufacturing Technology, vol. 29, no. 3-4, pp. 360-366, 2006.