A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates

International Journal of Production Research

Volumn 49, Issue 20, 2011, Pages 5957-5985

  Frosolini, M ^a   Braglia, M ^a   Zammori, F A ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

genetic algorithms; harmony search optimisation; multi criteria methodologies; permutation flowshop scheduling

Indexed keywords

DUE DATES; EFFICIENT GENETIC ALGORITHMS; FLOW SHOP SCHEDULING PROBLEM; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; LARGE REGIONS; MULTI OBJECTIVE; MULTI-CRITERIA METHODOLOGIES; NONDOMINATED SOLUTIONS; OPTIMAL VALUES; OPTIMISATIONS; PERMUTATION FLOW-SHOP SCHEDULING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SCHEDULING PROBLEM; SOLUTION SPACE;

OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 80052162860     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.528056     Document Type: Article

References (47)

1. Braglia, M. and Grassi, A., 2009. A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research, 47 (1), 273-288.
2. Campbell, H.G., Dudek, R.A., and Smith, M.L., 1970. A heuristic algorithm for the n job m machine sequencing problem. Management Science, 16 (10), B630-B637.
3. Cao, D. and Chen, M., 2003. Parallel flowshop scheduling using tabu search. International Journal of Production Research, 41 (13), 3059-3073.
4. Carlier, J. and Rebai, I., 1996. Two branch-and-bound algorithms for the permutation flow shop problem. European Journal of Operational Research, 90 (2), 238-251. (Pubitemid 126652212)
5. Cheng, J., Kise, H., and Matsumoto, H., 1997. A branch-and-bound algorithm with fuzzy inference for a permutation flow shop scheduling problem. European Journal of Operational Research, 96 (3), 578-590. (Pubitemid 127378191)
6. Cheng, J., Steiner, G., and Stephenson, P., 2001. A computational study with a new algorithm for the three-machine permutation flow-shop problem with release time. European Journal of Operational Research, 130 (3), 559-575. (Pubitemid 32875311)
7. Dannenbring, D.G., 1977. An evaluation of flow shop sequencing heuristics. Management Science, 23 (11), 1174-1182.
8. Esbensen, H., 1996. Defining solution set quality. Memorandum no. UCB/ERL M96/1. Electric Research Laboratory, College of Engineering, University of California, Berkeley.
9. Grabowski, J. and Wodecki, M., 2004. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers and Operations Research, 31 (11), 1891-1909. (Pubitemid 38527452)
10. Gangadharan, R. and Rajendran, C., 1994. A simulated annealing heuristic for scheduling in a flowshop with bicriteria. In: Proceedings of the 16th international conference on computers and industrial engineering, 7-9 March, Ashikaga, Japan, 345-348.
11. Geem, Z.W., Kim, J.H., and Loganathan, G.V., 2001. A new heuristic optimization algorithm: Harmony search. Simulation, 76 (2), 60-68. (Pubitemid 32543074)
12. Geem, Z.W., Lee, K.S., and Park, Y., 2005. Application of harmony search to vehicle routing. American Journal of Applied Sciences, 2 (12), 1552-1557.
13. Geem, Z.W., 2006. Optimal cost design of water distribution networks using harmony search. Engineering Optimization, 38 (3), 259-280.
14. Goldberg, D.E., 1989. Genetic algorithms in search, optimization and machine learning. Reading. MA: Addison-Wesley.
15. Gupta, J.N.D. and Stafford Jr., E.F., 2006. Flowshop scheduling research after five-decades. European Journal of Operational Research, 169 (3), 699-711.
16. Haouari, M. and Ladhari, T., 2003. A branch-and-bound-based local search method for the flow shop problem. Journal of the Operational Research Society, 54 (10), 1076-1084.
17. Hejazi, S.R. and Saghafian, S., 2005. Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43 (14), 2895-2929. (Pubitemid 41657440)
18. Ignall, E. and Schrage, L.E., 1965. Application of branch and bound technique to some flow-shop problems. Operations Research, 13 (3), 400-412.
19. Ishibuchi, H. and Murata, T., 1998. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 28 (3), 392-403. (Pubitemid 128748638)
20. Johnson, S.M., 1954. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly, 1 (1), 61-68.
21. Khan, B.S.H., Prabhaharan, G., and Asokan, P., 2007. A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. International Journal of Computer Mathematics, 84 (12), 1731-1741. (Pubitemid 350157661)
22. Kim, J.H., Geem, Z.W., and Kim, E.S., 2001. Parameter estimation of the nonlinear Muskin-gum model using harmony search. Journal of the American Water Resources Association, 37 (5), 1131-1138. (Pubitemid 34009650)
23. Kim, S.H., et al., 2006. Transient analysis and leakage detection algorithm using GA and HS algorithm for a pipeline system. Journal of Mechanical Science and Technology, 20 (3), 426-434.
24. Ladhari, T. and Haouari, M., 2005. A computational study of the permutation flow shop problem based on a tight lower bound. Computers and Operations Research, 32 (7), 1831-1847.
25. Lageweg, B.J., Lenstra, J.K., and Rinnooy Kan, A.H.G., 1978. A general bounding scheme for the permutation flow-shop problem. Operations Research, 26 (1), 53-67. (Pubitemid 8576421)
26. Law, A.M. and Kelton, W.D., 1991. Simulation modeling and analysis. New York: McGraw-Hill.
27. Lee, K.S. and Geem, Z.W., 2004. A new structural optimization method based on the harmony search algorithm. Computers and Structures, 82 (9-10), 781-798.
28. Lin, S.W., et al., 2009. Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times. International Journal of Production Research, 47 (12), 3205-3217.
29. Murata, T., Ishibuchi, I., and Tanaka, H., 1996. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers and Industrial Engineering, 30 (4), 957-968. (Pubitemid 126375906)
30. Nawaz, M., Enscore Jr., E.E., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega, 11 (1), 91-95. (Pubitemid 13193807)
31. Nowicki, E. and Smutnicki, C., 1996. A fast tabu search algorithm for the flow shop problem. European Journal of Operational Research, 91 (1), 160-175. (Pubitemid 126369642)
32. Osman, I.H. and Potts, C.N., 1989. Simulated annealing for permutation flow-shop scheduling. Omega, 17 (6), 551-557.
33. Pan, J.C.H. and Fan, E.T., 1997. Two-machine flowshop scheduling to minimize total tardiness. International Journal of Systems Science, 28 (4), 405-414.
34. Pinedo, M., 1995. Scheduling: Theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice-Hall.
35. Ponnambalam, S.G., et al., 2004. A TSP-GA multi-objective algorithm for flow-shop scheduling. International Journal of Advanced Manufacturing Technology, 23 (11-12), 909-915.
36. Potts, C.N., 1980. An adaptive branching rule for the permutation flow-shop problem. European Journal of Operational Research, 5 (1), 19-25. (Pubitemid 11429284)
37. Rajendran, C., 1994. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research, 32 (11), 2541-2558.
38. Rajendran, C. and Ziegler, H., 2005. Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers and Industrial Engineering, 48 (4), 789-797. (Pubitemid 40391497)
39. Rajkumar, R. and Shahabudeen, P., 2009. An improved genetic algorithm for the flowshop scheduling problem. International Journal of Production Research, 47 (1), 233-249.
40. Schaffer, J.D., 1985. Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms, 24-26 July, Pittsburgh, PA. Mahwah, NJ: Lawrence Erlbaum, 93-100.
41. Srikanth, K.I. and Barkha, S., 2004. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research, 31 (4), 593-606.
42. Stevens, J.W. and Gemill, D.D., 1997. Scheduling a two-machine flowshop with travel times to minimize maximum lateness. International Journal of Production Research, 35 (1), 1-15. (Pubitemid 127553365)
43. Tasgetiren, M.F., et al., 2007. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177 (3), 1930-1947. (Pubitemid 44780934)
44. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., and Hossein Mirzaei, A., 2007. Solving a multiobjective no-wait flowshop problem by a hybrid multi-objective immune algorithm. In: E. Levner, ed., Multiprocessor scheduling: Theory and applications. Vienna, Austria: Itech Education and Publishing.
45. T'Kindt, V. and Billaut, J.C., 2001. Multicriteria scheduling problems: A survey. Operations Research, 35 (2), 143-163.
46. Tseng, L.Y. and Lin, Y.T., 2009. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 198 (1), 84-92.
47. Yandra, Y. and Tamura, H., 2007. A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems. International Journal of Computer Integrated Manufacturing, 20 (5), 465-477. (Pubitemid 47181976)