A hybrid bio-geography based optimization for permutation flow shop scheduling

Scientific Research and Essays

Volumn 6, Issue 10, 2011, Pages 2078-2100

  Yin, Minghao ^a,b   Li, Xiangtao ^a,b  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b JILIN UNIVERSITY   (China)

Author keywords

Biogeography based optimization; Local search; Memetic algorithm; Permutation flow shop scheduling

Indexed keywords

EID: 79958778133     PISSN: None     EISSN: 19922248     Source Type: Journal    
DOI: 10.5897/sre10.818     Document Type: Article

References (54)

1. Bansal SP (1977). Minimizing the sum of completion times of n-jobs over M-machines in a flowshop---a branch and bound approach, AIIE Trans., 9: 306-311.
2. Bassem J, Eddaly M (2009). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Comput. Operat. Res., 36: 2638-2646.
3. Bhattacharya A, Chattopadhyay P (2010). Biogeography-based optimization for different economic load dispatch problems, IEEE Trans Power Syst., 25: 1064-1077.
4. Bhattacharya A, Chattopadhyay P (2010). Solving complex economic load dispatch problems using biogeography-based optimization, Expert Syst. Appl., 37: 3605-3615.
5. Campbell HG, Dudek RA, Smith ML (1970). A heuristic algorithm for the n job, m machine sequencing problem, Manage. Sci.,16:630-637.
6. Cariler J (1978). Ordonnancements a contraintes disjonctives, R.A.I.R.O. Recherche Operationelle/Oper.12: 333-351.
7. Croce FD, Ghirardi M, Tadei R (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem, Eur. J. Operat. Res., 139: 293-301.
8. Croce FD, Narayan V, Tadei R (1996). The two-machine total completion time flow shop problem, Eur. J. Operat. Res., 90:227-237.
9. Demirkol E, Mehta S, Uzsoy R (1998), Benchmarks for shop scheduling problems. Eur. J. Operat. Res., 109: 137-141.
10. Dipak L, Uday K, Chakraborty (2007). An efficient stochastic hybrid heuristic for flowshop scheduling, Eng. Appl. Artif. intel., 20:851-856.
11. Dong XY, Huang HK (2009), An iterated local search algorithm for the permutation flowshop problem with total flowshop crition, Comput. Operat. Res., 36: 1664-1669.
12. Framinan JM, Leisten R (2003). An efficient constructive heuristic for flowtime minimization in permutation flow shops, OMEGA. 31: 311-317.
13. Garey MR, Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: Freeman, pp. x+338. ISBN 0-7167-1045-5.
14. Gong W, Cai Z, Ling C, Li H (2010). A real-coded biogeography-based optimization with mutation, Appl. Math. Comput., 216: 2749-2758.
15. Grabowski J, Wodecki M (2004). A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Comput. Operat. Res., 31: 1891-1909.
16. Gupta JND (1972). Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions. 4: 11-18.
17. Ho JC, Chang YL(1991). A new heuristic for the n-job, M-machine flow-shop problem, Eur. J. Operat. Res., 52: 194-202.
18. Ignall E, Schrage L (1965). Application of the branch and bound technique to some flowshop scheduling problem, Operat. Res., 13: 400-412.
19. Johnson SM (1954). Optimal two-and three-stage production schedules, Naval Res. Logist. Quart., 1: 61-68.
20. Liu B, Wang L (2007). An Effective PSO-Based Memetic Algorithm for flow shop scheduling, IEEE Transaction Systems, Man, Cybernetics- Part B. 37: 18-27.
21. i scheduling problem, Eur. J. Operat. Reas., 132: 439-452.
22. Ma H (2010). An analysis of the equilibrium of migration models for biogeography-based optimization, Inf. Sci., 180: 3444-3464.
23. Ma H, Simon D (2010). Biogeography-based optimization with blended migration for constrained optimization problems, Gen. Evol. Comput. Conf. Portland, Oregon., 6: 417-418.
24. Ma H, Simon D (2010). Blended biogeography-based optimization for constrained optimization, Engineering Applications of Artificial Intelligence, 24(3): 517-525.
25. Murata T, Ishibuchi H, Tanaka H (1996). Genetic algorithms for flowshop scheduling problems, Comput. Operat. Res., 30: 1061-1071.
26. Nawaz M, Enscore Jr EE, Ham I (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA. 11: 91-95.
27. Nearchou AC (2004). A novel metaheuristic approach for the flow shop scheduling problem, Eng. Appl. Artif. Intel. 17: 289-300.
28. Nowicki E, Smutnicki C (1996). A fast tabu search algorithm for the permutation flowshop problem, Eur. J. Operat. Res., 91:160-175.
29. Ogbu F, Smith D (1990). The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Comput. Operat. Res., 17: 243-253.
30. Orhan E, Alper D (2004). A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future Generat. Comput. Systs., 20: 1083-1095.
31. Osman I, Potts C (1989). Simulated annealing for permutation flow shop scheduling, OMEGA. 17: 551-557.
32. Palmer DS (1965). Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum, Operat. Res. Quart., 16:101-107.
33. Qian B, wang L (2008).A hybrid differential evolution method for permutation flow-shop scheduling, The International J. Adv. Man. Technol., 38: 757-777.
34. Rajendran C (1993), Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, Int. J. Prod. Econ., 29: 65-73.
35. Rajendran C, Ziegler H (2004). Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, Eur. J. Operat. Res., 155: 426-438.
36. Reeves C (1995). A genetic algorithm for flowshop sequencing, Comput. Operat. Res., 22: 5-13.
37. Reeves C, Yamada T (1998). Genetic algorithms, path relinking and the flowshop sequencing problem, Evol. Comput., 6:45-60.
38. Revees C (1993). Improving the efficiency of tabu search for machine sequencing problem, J. Operat. Res. Soc., 44: 375-382.
39. Rinnooy KAHG (1976). Machine Scheduling Problems: Classification, Complexity, and Computations, Nijhoff, The Hague, pp.130-194.
40. Roy P, Ghoshal S, Thakur S (2010). Biogeography-based optimization for economic load dispatch problems, Electric Power Compon. Syst., 38:166-181.
41. Simon D (2008). Biogeography-Based Optimization. IEEE Trans. Evol. Comput., 12: 702-713.
42. Stadtler H (2005). Supply chain management and advanced planning basics, overview and challenges, Eur. J. Operat. Res., 163: 575-588.
43. Stafford EF (1988). On the development of a mixed integer linear programming model for the flowshop sequencing problem, J. Operat. Res. Soc., 39: 1163-1174.
44. Stützle T (1998). Applying iterated local search to the permutation flowshop problem, Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellctics Group, Darmstad, Germany.
45. Stützle T (1998). An ant approach to the flowshop problem, In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT'98), Verlag Mainz, Aachen, Germany, pp. 1560-1564.
46. Taillard E (1990), Some efficient heuristic methods for the flowshop sequencing problems, Eur. J. Operat. Res., 47:65-74.
47. Taillard E (1993). Benchmarks for basic scheduling problems. Eur. J. Operat. Res., 64: 278-285.
48. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, Eur. J. Operational Res., 177: 1930-1947.
49. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2004). Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem. In: Proceedings of the fourth international symposium on intelligent manufacturing systems. Turkey: Sakarya, pp. 431-41.
50. Tseng LY, Lin YT (2009). A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, Eur. J. operat. Res., 198: 84-92.
51. Wang L, Wu H, Tang F, Zheng DZ (2005). A hybrid quantum inspired genetic algorithm for flow shop scheduling, Lect Notes Comput. Sci., 3645: 636-644.
52. Wang L, Zheng DZ (2003). An effective hybrid heuristic for flow shop scheduling, The Int. J. Adv. Man. Technol., 21: 38-44.
53. Zhang Y, Li XP, Wang Q (2009). Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, Eur. J. Operat. Res.,196: 869-876.
54. Zheng TM, Yamashiro MS (2010). Solving flow shop scheduling problems by quantum differential evolutionary algorithm, Int J Adv Manuf Technol., DOI 10.1007/s00170-009-2438-4.