Scheduling job shop problems with sequence-dependent setup times

International Journal of Production Research

Volumn 47, Issue 21, 2009, Pages 5959-5976

  Naderi, B ^a   Zandieh, M ^b   Fatemi Ghomi, S M T ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Genetic algorithm; Job shop; Meta heuristics; Sequence dependent setup times; Taguchi method

Indexed keywords

COMPLETION TIME; HYBRID ALGORITHMS; HYBRID GENETIC ALGORITHMS; JOB SHOP; JOB SHOP PROBLEM; LOCAL SEARCH; MAKESPAN; META-HEURISTICS; SEQUENCE DEPENDENT SETUP TIMES; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME;

GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING ALGORITHMS; TAGUCHI METHODS;

MATHEMATICAL OPERATORS;

EID: 70449561153     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802165817     Document Type: Article

References (47)

1. Al-Aomar, R., 2006. Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs. Simulation Modeling Practice and Theory, 14, 201-223.
2. Allahverdi, A., et al., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187 (3), 985-1032.
3. Baker, K.R., 1974. Introduction to sequencing and scheduling. New York: Wiley.
4. Brucker, P. and Thiele, O., 1996. A branch-and-bound method for general shop problem with sequence-dependent setup times. OR Spectrum, 18, 145-161.
5. Caprihan, R. and Wadhwa, S., 2005. Scheduling of FMSs with information delays: a simulation study. International Journal of Flexible Manufacturing System, 17, 39-65.
6. Chandrasekaran, M., et al., 2006. Solving job shop scheduling problems using artificial immune system. International Journal of Advanced Manufacturing Technology, 31, 580-593.
7. Cheng, B.W. and Chang, C.L., 2007. A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Systems with Applications, 32, 415-421.
8. Cheng, R., Gen, M., and Tsujimura, Y., 1999. A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Computers & Industrial Engineering, 36, 343-364.
9. 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, 65-81. (Pubitemid 33634450)
10. Choi, I. and Korkmaz, O., 1997. Job shop scheduling with separable sequence-dependent setups. Annals of Operations Research, 70, 155-170.
11. Cochran, W.G. and Cox, G.M., 1992. Experimental designs. 2nd ed. New York: Wiley.
12. Coleman, B.J., 1992. Technical note: a simple model for optimizing the single machine early/tardy problem with sequence-dependent setups. Production and Operations Management, 1, 225-228.
13. Davis, L., 1985. Applying adaptive algorithms to epistatic domains. In: Proceedings of the international joint conference on artificial intelligence, (IJCAI) Los Angeles, 162-164.
14. Eddie, Y.K., Ng, E.W., and Kee, N., 2006. Parametric study of the biopotential equation for breast tumour identification using ANOVA and Taguchi method. International Federation for Medical and Biological Engineering, 44, 131-139.
15. Goldberg, D.E. and Lingle, R., 1985. Alleles, loci and the traveling salesman problem. In: J.J. Grefenstette, ed. In: Proceedings of the first international conference on genetic algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates, 154-159.
16. Goldberg, D.E., 1989. Genetic algorithms in search, optimisation and machine learning. Reading, MA: Addison-Wesley.
17. Goncalves, J.F., Mendes, J.J.D.M., and Resende, M.G.C., 2005. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167, 77-95.
18. Gupta, S.K., 1986. N Jobs and n machines job-shop problems with sequence-dependent set-up times. International Journal of Production Research, 20 (5), 643-656.
19. Heinonen, J. and Pettersson, F., 2007. Hybrid ant colony optimisation and visibility studies applied to a job-shop scheduling problem. Applied Mathematics and Computation, 187, 989-998.
20. Holland, J., 1975. Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
21. Kurz, M.E. and Askin, R.G., 2003. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85, 371-388.
22. Kurz, M.E. and Askin, R.G., 2004. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, 159, 66-82.
23. Luh, P.B., et al., 1998. Job shop scheduling with group dependent setups, finite buffers, and long time horizon. Annual of Operation Research, 76, 233-259.
24. Luo, F., et al., 2008. Application of Taguchi's method in the optimisation of bridging efficiency between confluent and fresh micro carriers in bead-to-bead transfer of Vero cells. Biotechnology Letters, 30, 645-649.
25. Michalewicz, Z., 1996. Genetic algorithms+data structures=evolution programs. 3rd ed. Berlin: Springer.
26. Monma, C.L. and Potts, C.N., 1989. On the complexity of scheduling with batch setup times. Operations Research, 37, 798-804.
27. Montgomery, D.C., 2000. Design and analysis of experiments. 5th ed. New York: Wiley.
28. Norman, B.A. and Bean, J.C., 1999. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics, 46, 199-211.
29. Ombuki, B. and Ventresca, M., 2004. Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence, 21, 99-109.
30. Park, B.J., Choi, H.R., and Kim, H.S., 2003. A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering, 45, 597-613.
31. Phadke, M.S., 1989. Quality engineering using robust design. Engelwood Cliffs, NJ: Prentice-Hall.
32. Pinedo, M., 1995. Scheduling: theory, algorithms and systems. Engelwood Cliffs, NJ: Prentice-Hall.
33. Ruiz, R., Maroto, C., and Alcaraz, J., 2005. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165, 34-54.
34. Ruiz, R. and Maroto, C., 2006. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169, 781-800.
35. Ruiz, R., Maroto, C., and Alcaraz, J., 2006. Two new robust genetic algorithms for the flowshop scheduling problem. Omega, 34, 461-476.
36. Ruiz, R. and Stützle, T., 2008. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187 (3), 1143-1159.
37. Schutten, J.M.J., 1998. Practical job shop scheduling. Annals of Operations Research, 83, 161-178.
38. Sule, D.R., 1997. Industrial scheduling. New York: PWS Publishing Company.
39. Taguchi, G., 1986. Introduction to quality engineering. White Plains: Asian Productivity Organization/UNIPUB.
40. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
41. Tsai, J.T., et al., 2007. Improved immune algorithm for global numerical optimisation and job-shop scheduling problems. Applied Mathematics and Computation, 194, 406-424.
42. Viond, V. and Sridharan, R., 2008. Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis. International Journal of Advanced Manufacturing Technology, 36, 355-372.
43. Watanabe, M., Ida, K., and Gen, M., 2005. A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers & Industrial Engineering, 48, 743-752.
44. Zandieh, M., Fatemi Ghomi, S.M.T., and Moattar Husseini, S.M., 2006. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Journal of Applied Mathematics and Computation, 180, 111-127.
45. Zhang, C.Y., et al., 2008. Very fast TS/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35, 282-294.
46. Zhou, C. and Egbelu, P.G., 1989. Scheduling in a manufacturing shop with sequence-dependent setups. Robotics and Computer Integrated Manufacturing, 51, 73-81.
47. Zhou, Y., Beizhi, Li., and Yang, J., 2006. Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. International Journal of Advanced Manufacturing Technology, 30, 105-111.