Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem

IEEE Transactions on Automation Science and Engineering

Volumn 9, Issue 3, 2012, Pages 578-595

  Li, Xiaoping ^a,b   Zhang, Yi ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

Author keywords

Flow shops; genetic algorithm; makespan; sequence dependent setup time; weighted tardiness

Indexed keywords

ADAPTIVE HYBRID GENETIC ALGORITHM; COMPUTATION TIME; EFFECTIVE ALGORITHMS; FLOW-SHOPS; HIGH PROBABILITY; HYBRID ALGORITHMS; INTEGRATED ALGORITHM; LOCAL SEARCH; LOCAL SEARCH METHOD; MAKESPAN; PERMUTATION FLOW-SHOP SCHEDULING; SEQUENCE-DEPENDENT SETUP TIME; TOTAL-WEIGHTED TARDINESS; WEIGHTED TARDINESS;

GENES; MACHINE SHOP PRACTICE; PROBABILITY; SCHEDULING; SCHEDULING ALGORITHMS;

GENETIC ALGORITHMS;

EID: 84863501385     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2012.2192729     Document Type: Article

References (40)

1. R. L. Graham, J. K. LenstraKan, and A. H. G. Rinnooy, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Ann. Discrete Math., vol. 5, pp. 287-326, 1979.
2. J. N. D. Gupta, "Flowshop schedules with sequence dependent setup times," J. Oper. Res. Soc. Jpn., vol. 29, pp. 206-219, 1986.
3. B. D. Corwin and A. O. Esogbue, "Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic-programming approach," Nav. Res. Logist., vol. 21, pp. 515-524, 1974.
4. F. T. TsengJr and E. F. Stafford, "Two MILP models for the SDST flowshop sequencing problem," Int. J. Prod. Res., vol. 39, pp. 1777-1809, 2001.
5. E. F. Stafford, Jr and F. T. Tseng, "Two models for a family of flowshop sequencing problems," Eur. J. Oper. Res., vol. 142, pp. 282-293, 2002.
6. R. Z. Ríos-Mercado and J. F. Bard, "Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups," Comput. Oper. Res., vol. 25, pp. 351-366, 1998.
7. R. Z. Ríos-Mercado and J. F. Bard, "The flow shop scheduling polyhedron with setup times," J. Combinatorial Opt., vol. 7, pp. 291-318, 2003.
8. J. V. Simons, Jr, "Heuristics in flow shop scheduling with sequence dependent setup times," Omega, vol. 20, pp. 215-225, 1992.
9. S. R. Das, J. N. D. Gupta, and B. M. Khumawala, "A savings index heuristic algorithm for flowshop scheduling with sequence-dependent set-up times," J. Oper. Res. Soc., vol. 46, pp. 1365-1373, 1995.
10. R. Z. Ríos-Mercado and J. F. Bard, "Heuristics for the flow line problem with setup costs," Eur. J. Oper. Res., vol. 110, pp. 76-98, 1998.
11. R. Z. Ríos-Mercado and J. F. Bard, "An enhanced tsp-based heuristic for makespan minimization in a flow shop with setup times," J. Heuristics, vol. 5, pp. 53-70, 1999.
12. M. Nawaz, E. E. Enscore, and I. Ham, "A heuristic algorithm for the m-machine n-job flow-shop sequencing problem," Omega, vol. 11, pp. 91-95, 1983.
13. R. Ruiz and C. Maroto, "A comprehensive review and evaluation of permutation flowshop heuristics," Eur. J. Oper. Res., vol. 165, pp. 479-494, 2005.
14. R. Ruiz, C. Maroto, and J. Alcaraz, "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, " Eur. J. Oper. Res., vol. 165, pp. 34-54, 2005.
15. R. Ruiz and T. Stützle, "An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," Eur. J. Oper. Res., vol. 187, pp. 1143-1159, 2008.
16. M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Upper Saddle, NJ: Prentice-Hall, 2002.
17. S. Parthasarathy and C. Rajendran, "A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-A case study," Prod. Planning Control, vol. 8, pp. 475-483, 1997.
18. S. Parthasarathy and C. Rajendran, "An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs," Int. J. Prod. Econ., vol. 49, pp. 255-263, 1997.
19. C. Rajendran and H. Ziegler, "Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times," Eur. J. Oper. Res., vol. 149, pp. 513-522, 2003.
20. H. C. W. Lau, T. M. Chan, W. T. Tsui, and W. K. Pang, "Application of genetic algorithms to solve the multidepot vehicle routing problem," IEEE Trans. Autom. Sci. Eng., vol. 7, no. 2, pp. 383-392, Apr. 2009.
21. Z. Yang and P. I. Rockett, "Application of multiobjective genetic programming to the design of robot failure recognition systems," IEEE Trans. Autom. Sci. Eng., vol. 6, no. 2, pp. 372-376, Apr. 2008.
22. C. R. Reeves, "A genetic algorithm for flowshop sequencing," Comput. Oper. Res., vol. 22, pp. 5-13, 1995.
23. T. Murata, H. Ishibuchi, and H. Tanaka, "Multi-objective genetic algorithm and its applications to flowshop scheduling," Comput. Ind. Eng., vol. 30, pp. 957-968, 1996.
24. R. Ruiz, C. Maroto, and J. Alcaraz, "Two newrobust genetic algorithms for the flowshop scheduling problem," Omega, vol. 34, pp. 461-476, 2006.
25. Y. Zhang, X. Li, and Q.Wang, "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," Eur. J. Oper. Res., vol. 196, pp. 869-876, 2009.
26. C. F. Juang, "A hybrid of genetic algorithm and particle swarm optimization for recurrent network design," IEEE Trans. Syst., Man, Cybern. (Part B), vol. 34, pp. 997-1006, 2004.
27. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and L. M.Wang, "An improved GA and a novel PSO-GA based hybrid algorithm," Inform. Process. Lett., vol. 93, pp. 255-261, 2005.
28. T. T. Kao and E. Zahara, "A hybrid genetic algorithm and particle swarm optimization for multimodal functions," Appl. Soft Comput., vol. 8, pp. 849-857, 2008.
29. Y. S. Yun, "Reinforced adaptive hybrid algorithm using genetic algorithm and particle swarm optimization," in Proc. APIEMS, Kitakyushu, Japan, 2009, pp. 2993-2997.
30. W. F. Abd-El-Wahed, A. A. Mousa, and M. A. El-Shorbagy, "Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems," J. Comput. Appl. Math., vol. 235, pp. 1446-1453, 2011.
31. P. Merz and B. Freisleben, "Genetic local search for the TSP: New results," in Proc. 4th IEEE Int. Conf. Evol. Comput., Indianapolis, MN, 1997, pp. 159-164.
32. N. Krasnogor and J. Smith, "A memetic algorithm with self-adaptive local search: TSP as a case study," in Proc. Genetic Evol. Comput. Conf., Las Vegas, NV, 2000, pp. 987-994.
33. H. Ishibuchi, T. Yoshida, and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 204-223, Apr. 2003.
34. E. Vallada and R. Ruiz, "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, vol. 38, pp. 57-67, 2010.
35. X. Li, Q. Wang, and C. Wu, "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, vol. 37, pp. 155-164, 2009.
36. C. Rajendran and H. Ziegler, "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," Eur. J. Oper. Res., vol. 37, pp. 155-164, 2009.
37. J. Liu and C. R. Reeves, "Constructive and composite heuristic solutions to the scheduling problem," Eur. J. Oper. Res., vol. 132, pp. 439-452, 2001.
38. E. Taillard, "Benchmarks for basic scheduling problems," Eur. J. Oper. Res., vol. 64, pp. 278-285, 1993.
39. S. Hasija and C. Rajendran, "Scheduling in flowshops to minimize total tardiness of jobs," Int. J. Prod. Res., vol. 42, pp. 2289-2301, 2004.
40. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai, "A combinatorial particle swarm optimization for solving permutation flowshop problems," Comput. Ind. Eng., vol. 54, pp. 526-538, 2008.