A genetic local search algorithm based on insertion neighborhood for the job shop scheduling problem

Advances in Information Sciences and Service Sciences

Volumn 3, Issue 5, 2011, Pages 117-125

  Zhang, Rui ^a  

^a NANCHANG UNIVERSITY   (China)

Author keywords

Genetic local search; Job shop scheduling; Neighborhood property

Indexed keywords

COMPUTATIONAL EXPERIMENT; DUAL FORM; GENETIC LOCAL SEARCH; GENETIC LOCAL SEARCH ALGORITHM; HYBRID GENETIC ALGORITHMS; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LINEAR PROGRAMMING MODELS; LOCAL SEARCH; NEIGHBORHOOD PROPERTY; NEIGHBORHOOD STRUCTURE; OPTIMIZATION EFFICIENCY; SEARCHING CAPABILITY; TOTAL-WEIGHTED TARDINESS;

COMPUTER PROGRAMMING; GENETIC ALGORITHMS; LEARNING ALGORITHMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 79960136764     PISSN: 19763700     EISSN: None     Source Type: Journal    
DOI: 10.4156/aiss.vol3.issue5.15     Document Type: Article

References (19)

1. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimisation and approximation in deterministic sequencing and scheduling: a survey," Annals of Discrete Mathematics, vol. 5, pp. 287-326, 1979.
2. 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.
3. A. P. Vepsalainen and T. E. Morton, "Priority rules for job shops with weighted tardy costs," Management Science, vol. 33, no. 8, pp. 1035-1047, 1987.
4. E. Kutanoglu and I. Sabuncuoglu, "An analysis of heuristics in a dynamic job shop with weighted tardiness objectives," International Journal of Production Research, vol. 37, no. 1, pp. 165-187, 1999.
5. M. Pinedo and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics, vol. 46, no. 1, pp. 1-17, 1999.
6. 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.
7. L. Monch and R. Drießel, "A distributed shifting bottleneck heuristic for complex job shops," Computers & Industrial Engineering, vol. 49, no. 3, pp. 363-380, 2005.
8. S. Kreipl, "A large step random walk for minimizing total weighted tardiness in a job shop," Journal of Scheduling, vol. 3, no. 3, pp. 125-138, 2000.
9. D. C. Mattfeld and C. Bierwirth, "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research, vol. 155, no. 3, pp. 616-630, 2004.
10. 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.
11. I. Essafi, Y. Mati, and S. Dauzere-Peres, "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.
12. M. Singer, "Decomposition methods for large job shops," Computers & Operations Research, vol. 28, no. 3, pp. 193-207, 2001.
13. M. Asano and H. Ohta, "A heuristic for job shop scheduling to minimize total weighted tardiness," Computers & Industrial Engineering, vol. 42, no. 2-4, pp. 137-147, 2002.
14. V. Amaral Armentano and C. Rigao Scrich, "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, vol. 63, no. 2, pp. 131-140, 2000.
15. 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.
16. 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.
17. 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.
18. P. Brucker, Scheduling Algorithms (5th ed.). Berlin, Heidelberg: Springer, 2007.
19. 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.