A variable neighbourhood search algorithm for job shop scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 261-271

  Sevkli, Mehmet ^a   Aydin, M Emin ^b  

^a FATIH UNIVERSITY   (Turkey)

^b UNIVERSITY OF BEDFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; SCHEDULING;

JOB SHOP SCHEDULING (JSS); VARIABLE NEIGHBOURHOOD SEARCH (VNS);

INDUSTRIAL ENGINEERING;

EID: 33745784126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_22     Document Type: Conference Paper

References (28)

1. Adams, J., Balas, E., and Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34 (1988) 391-401
2. Aiex, R. M. Binato, S., and Resende, M. G. C.: Parallel GRASP with Path-Relinking for Job Shop Scheduling. Parallel Computing 29 (2003) 393-430.
3. Applegate, D., and Cook, W.: A Computational Study of Job-Shop Scheduling. ORSA Journal on Computing 3(2) (1991) 149-156.
4. Aydin, M. E., and Fogarty, T. C.: A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems. Journal of Heuristics 10 (2004) 269-292.
5. Balas, E., and Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science 44 (1998) 262-275.
6. Beasley, J.E. "Obtaining Test Problems via Internet." Journal of Global Optimisation 8, 429-433, http://people.brunel.ac.uk/~mastjjb/jeb/info. html.
7. Bierwith, C.: A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. OR Spektrum 17 (1995) 87-92.
8. Blum, C., and Sampels, M.: An Ant Colony Optimization Algorithm for Shop Scheduling Problems. Journal of Mathematical Modelling and Algorithms 3 (2004) 285-308.
9. Bruce, K.B., Cardelli, L., Pierce, B.C.: Comparing Object Encodings. In: Abadi, M., Ito, T. (eds.): Theoretical Aspects of Computer Software. Lecture Notes in Computer Science, Vol. 1281. Springer-Verlag, Berlin Heidelberg New York (1997) 415-438
10. Carlier, J., and Pison, E.: An Algorithm for Solving the Job-Shop Problem, Management Science 35 (1989) 164-176.
11. Cheng, R., Gen, M., and Tsujimura, Y.: A Tutorial Survey of Job Shop Scheduling Problems Using genetic Algorithms-I. Representation. Journal of Computers and Industrial Engineering 30(4) (1996) 983-997.
12. Colorni, A., Dorigo, M., Maniezzo, V., and Trubian, M.: Ant System for Job-Shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL) 34(1) (1994) 39-53.
13. DeH'Amico, M., and Trubian, M.: Applying Tabu-Search to the Job-Shop Scheduling Problem. Annals of Operations Research 4 (1993) 231-252.
14. Dorndorf, U., and Pesch, E.: Evolution Based Learning in a Job Shop Scheduling Environment, Computers & Operations Research 22 (1995) June 26, 2005 0:30 International Journal of Production Research "A hybrid PSO for the JSSP"
15. Dorndorf, U., Pesch, E., and Phan-Huy, T.: Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem, Annals of Operations Research 115 (2002) 125-145.
16. Garey, M. Johnson, D., and Sethy, R.: The Complexity of Flow Shop and Job Shop Scheduling. Mathematics of Operations Research 1 (1976) 117-129.
17. Groce, F. D. Tadei, R., and Volta, G.: A Genetic Algorithm for the Job Shop Problem. Computers & Operations Research 22 (1995) 15-24.
18. Goncalves, J. F., Mendes, J. M., and Resende, M.: A hybrid genetic algorithm for the job shop scheduling problem, European Journal of Operations Research 167(1) (2004) 77-95.
19. Huang, W., and Yin, A.: An Improved Shifting Bottleneck Procedure for the Job Shop Scheduling Problem. Computers & Operations Research 31 (2004) 2093-2110.
20. Jain, A., and Meeran, S.: Deterministic Job-Shop Scheduling: Past, Present and Future. European Journal of Operational Research. 113: (1999) 390-434.
21. Kolonko, M.: Some New Results on Simulated Annealing Applied to the Job Shop Scheduling Problem. European Journal of Operational Research 113, (1999) 123-136.
22. Mladenovic, N., and Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24 (1997) 1097-1100.
23. Nowicki, E., and Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science 42 (1996) 797-813.
24. 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:297-310, 2000.
25. Ribeiroa, C. C. and Souza, M., C.: Variable neighborhood search for the degree-constrained minimum spanning tree problem, Discrete Applied Mathematics 118 (2002) 43-54
26. Satake, T., Morikawa, K., Takahashi, K., and Nakamura, N.: Neural Network Approach for Minimizing the Makespan of the General Job- Shop. International Journal of Production Economics 33 (1994) 67-74.
27. Satake, T., Morikawa, K., Takahashi, K., and Nakamura, N.: Simulated Annealing Approach for Minimizing the Makespan of the General Job- Shop. International Journal of Production Economics 60 (1999) 515-522.
28. Urosevic,D., Brimberg,J. and Mladenovic, N., Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem, Computers & Operations Research 31 (2004) 1205-1213