A variable neighbourhood search algorithm for the flexible job-shop scheduling problem

International Journal of Production Research

Volumn 48, Issue 19, 2010, Pages 5671-5689

  Amiri, M ^a   Zandieh, M ^b   Yazdani, M ^c   Bagheri, A ^d  

^a ALLAMEH TABATABA'I UNIVERSITY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

^c ISLAMIC AZAD UNIVERSITY   (Iran)

^d DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

Author keywords

combinatorial optimisation; flexible job shop scheduling; makespan; variable neighbourhood search

Indexed keywords

BENCH-MARK PROBLEMS; BEST-KNOWN ALGORITHMS; COMBINATORIAL OPTIMISATION; COMPUTATIONAL STUDIES; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; GENERALISATION; JOB SHOP SCHEDULING PROBLEMS; MAKESPAN; NEIGHBOURHOOD; SEQUENCING PROBLEMS; SUB-PROBLEMS; VARIABLE NEIGHBOURHOOD SEARCH;

COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 77955573212     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540903055743     Document Type: Article

References (32)

1. Avanthay, C., Hertz, A., and Zufferey, N., 2003. A variable neighborhood search for graph coloring. European Journal of Operational Research, 151 (2), 379-388.
2. Barnes, J.W. and Chambers, J.B., 1996. Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering. University of Texas, Austin, Technical Report Series, ORP96-09.
3. Brandimarte, P., 1993. Routing and scheduling in a flexible job shop by taboo search. Annals of Operations Research, 41 (3), 157-183.
4. Brimberg, J., et al., 2000. Improvement and comparison of heuristics for solving the uncapacitated multisource Weber problem. Operations Research, 48 (3), 444-460.
5. Brucker, P. and Schlie, R., 1990. Job-shop scheduling with multi-purpose machines. Computing, 45 (4), 369-375.
6. Chan, F.T.S., Wong, T.C., and Chan, L.Y., 2006. Flexible job-shop scheduling problem under resource constraints. International Journal of Production Research, 44 (11), 2071-2089.
7. Chen, H., Ihlow, J. and Lehmann, C., 1999. Agenetic algorithm for flexible job-shop scheduling. In: Proceedings of the IEEE international conference on robotics and automation, May 1999, Detroit, Michigan 1120-1125.
8. Dauzére-Péré s, S. and Paulli, J., 1997. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70 (3), 281-306.
9. Fattahi, P., Saidi Mehrabad, M., and Jolai, F., 2007. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 18 (3), 331-342.
10. Fisher, H. and Thompson, G.L., 1963. Probabilistic learning combinations of local job shop scheduling rules, In: J.F. Muth and G.L. Thompson, eds. Industrial scheduling. Englewood Cliffs, NJ: Prentice-Hall, 225-251.
11. Gao, J., Sun, L., and Gen, M., 2008. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35 (9), 2892-2907.
12. Garey, M.R., Johnson, D.S., and Sethi, R., 1976. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research, 1 (2), 117-129.
13. Hansen, P. and Mladenovic, N., 1997. Variable neighborhood search for the P-median. Location Science, 5 (4), 207-226.
14. Hansen, P. and Mladenovic, N., 2001. Variable neighborhood search: principles and applications. European Journal of Operational Research, 130 (3), 449-467.
15. Hansen, P. and Mladenovic, N., 2002. J-means: a new local search heuristic for minimum sum-ofsquares clustering. Pattern Recognition, 34 (2), 405-413.
16. Hansen, P., Mladenovic, N., and Urosevic, D., 2006. Variable neighborhood search and local branching. Computers and Operations Research, 33 (10), 3034-3045.
17. Hurink, E., Jurisch, B., and Thole, M., 1994. Tabu search for the job shop scheduling problem with multi-purpose machine. Operations Research Spektrum, 15 (4), 205-215.
18. Kacem, I., Hammadi, S., and Borne, P., 2002a. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 32 (1), 1-13.
19. Kacem, I., Hammadi, S., and Borne, P., 2002b. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60 (3-5), 245-276.
20. Lawrence, S., 1984. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania.
21. Liang, Y.C. and Chen, Y.C., 2007. Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliability Engineering and System Safety, 92 (3), 323-331.
22. Mastrolilli, M. and Gambardella, L.M., 2000. Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3 (1), 3-20.
23. Mladenovic, N., 1995. A variable neighborhood algorithm-a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days: Montré al, 112-112
24. Mladenovic, N. and Hansen, P., 1997. Variable neighborhood search. Computers and Operations Research, 24 (11), 1097-1100.
25. Pezzella, F., Morganti, G., and Ciaschetti, G., 2008. A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35 (10), 3202-3212.
26. Pinedo, M., 2005. Planning and scheduling in manufacturing and services. New York: Springer.
27. Ribeiro, C.C. and Souza, M.C., 2002. Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Applied Mathematics, 118 (1-2), 43-54.
28. Sevkli, M. and Aydin, M.E., 2007. Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA Journal of Management Mathematics, 18 (2), 117-133.
29. Shi-Jin, W., Bing-Hai, Z., and Li-Feng, X., 2008. A filtered-beam-search- based heuristic algorithm for flexible job-shop scheduling problem. International Journal of Production Research, 46 (11), 3027-3058.
30. Tay, J.C. and Ho, N.B., 2008. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering, 54 (3), 453-473.
31. Xia, W. and Wu, Z., 2005. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 48 (2), 409-425.
32. Zhang, H-P and Gen, M., 2005. Multistage-based genetic algorithm for flexible job-shop scheduling problem. Journal of Complexity International, 11, 223-232.