A scatter search approach to sequence-dependent setup times job shop scheduling

International Journal of Production Research

Volumn 47, Issue 18, 2009, Pages 5217-5236

  Manikas, Andrew ^a   Chang, Yih Long ^b  

^a UNIVERSITY OF WISCONSIN OSHKOSH   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Manufacturing systems; Operational research; Operations management; Operations planning; Operations strategy; Production management; Production modelling; Production planning; Quality management; Scheduling

Indexed keywords

MANUFACTURING SYSTEM; OPERATIONAL RESEARCH; OPERATIONS PLANNING; OPERATIONS STRATEGIES; PRODUCTION MANAGEMENT; PRODUCTION PLANNING;

COMPUTATIONAL EFFICIENCY; HEURISTIC METHODS; INDUSTRIAL RESEARCH; MACHINE SHOPS; OPTIMAL SYSTEMS; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT; QUALITY CONTROL; QUALITY MANAGEMENT; SIMULATED ANNEALING; TABU SEARCH;

PLANNING;

EID: 70449642712     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701805646     Document Type: Article

References (35)

1. Adams, J., Balas, E. and Zawack, D., 1988. The shifting bottleneck procedure for job shop scheduling. Management Science, 34 (3), 391-401.
2. Blazewicz, J., Glover, F. and Kasprzak, M., 2004. DNA sequencing-tabu and scatter search combined. INFORMS Journal on Computing, 16 (3), 232-240.
3. Brander, P. and Forsberg, R., 2005. Cycle lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes. International Journal of Production Research, 43 (2), 295-310.
4. Cai, K.W., Wu, Q.H. and Yong, Z.Z., 2000. A genetic algorithm with local search for solving problems, Real-world applications of evolutionary computing, Evo workshops 2000, Edinburgh, Scotland. Berlin: Springer.
5. Campos, V., et al., 2001. An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization, 21, 397-414.
6. Campos, V., Laguna, M. and Mart?́, R., 2005. Context-independent scatter and tabu search for permutation problems. INFORMS Journal on Computing, 17 (1), 111-122.
7. Candido, M.A.B., Khator, S.K. and Barcia, R.M., 1998. A genetic algorithm based procedure for more realistic job shop scheduling problems. International Journal of Production Research, 36 (12), 3437-3457.
8. Chang, Y.L., Sueyoshi, T. and Sullivan, R.S., 1996. Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Transactions, 28, 631-642.
9. Chen, M.C., 2004. Optimizing machining economics models of turning operations using the scatter search approach. International Journal of Production Research, 42 (13), 2611-2625.
10. Cheung, W. and Zhou, H., 2001. Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Annals of Operations Research, 107 (1), 65-81. (Pubitemid 33634450)
11. Della Croce, F., Tadei, R. and Volta, G., 1995. A genetic algorithm for the job shop problem. Computers & Operations Research, 22 (1), 15-24.
12. Falkenauer, E. and Bouffouix, S., 1991. A genetic algorithm for the job shop. In: IEEE international conference on robotics and automation, Sacramento, CA.
13. França, P.M., Tin Jr, G. and Buriol, L.S., 2006. Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. International Journal of Production Research, 44 (5), 939-957.
14. Glover, F., 1989. Tabu search-part I. ORSA Journal on Computing, 1 (3), 190-206.
15. Glover, F., 1990a. Tabu search-part II. ORSA Journal on Computing, 2 (1), 4-32.
16. Glover, F., 1990b. Tabu search-a tutorial. Interfaces, 20 (4), 74-94.
17. Glover, F., Kelly, J. and Laguna, M., 1995. Genetic algorithms and tabu search: hybrids for optimization. Computers and Operations Research, 22 (1), 111-134.
18. Goldberg, D.E., 1989. Genetic algorithms in search, optimization, and machine learning. New York: Addison Wesley Longman.
19. Gonçalves, J.F., Magalhães Mendes, J.J. and Resende, M.G.C., 2005. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167, 77-95.
20. Holland, J., 1975. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press.
21. Manikas, A. and Chang, Y.L., 2006. Effective work ordering in a constrained manufacturing environment. In: Proceedings of the 36th international conference on computers and industrial engineering, Taipei, Taiwan.
22. Manikas, A. and Chang, Y.L., 2007. Multi-criteria sequence dependent job shop scheduling using genetic algorithms. Working Paper.
23. Marion, R.M., Luong, L.H.S. and Abhary, K., 2006. A genetic algorithm for the optimisation of assembly sequences. Computer and Industrial Engineering, 50 (4), 503-527.
24. Mattfeld, D. and Bierwirth, C., 2004. An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research, 155, 616-630.
25. Mitchell, M., 1996. An introduction to genetic algorithms. Cambridge, MA: MIT Press.
26. Muth, J.F. and Thompson, G.L., 1963. Industrial scheduling. Englewood Cliffs, NJ: Prentice Hall.
27. Park, B.J., Choi, H.R. and Kim, H.S., 2003. A hybrid genetic algorithm for the job shop scheduling problems. Computer & Industrial Engineering, 45, 597-613.
28. Pesch, E. and Tetzlaff, U.A.W., 1996. Constraint propagation based scheduling of job shops. INFORMS Journal on Computing, 8 (2), 144-157.
29. Phadke, M., 1989. Quality engineering using robust design. Englewood Cliffs, NJ: Prentice Hall.
30. Pinedo, M., 1995. Scheduling Theory, Algorithms and Systems. Englewood Cliffs, NJ: Prentice Hall.
31. Richter, H., 2002. An evolutionary algorithm for controlling chaos: the use of multi-objective fitness functions. Lecture Notes in Computer Science, Vol.2439. Proceedings of the 7th International Conference on parallel problem Solving from Nature, 308-320.
32. Schutten, J.M.J., 1998. Practical job shop scheduling. Annals of Operations Research, 83, 161-177.
33. Taguchi, G. and Wu, Y.I., 1979. Introduction to off-line quality control. Meieki Nakamura-Ku Magaya, Japan: Central Japan Quality Control Association.
34. Van Laarhoven, P.J.M., Aarts, E.H.L. and Lenstra, J.K., 1992. Job shop scheduling by simulated annealing. Operations Research, 40 (1), 113-125.
35. Vieira, G.E. and Ribas, P.C., 2004. A new multi-objective method for master production scheduling problems using simulated annealing. International Journal of Production Research, 42 (21), 4609-4622.