A Hybrid Intelligence Algorithm for No-Wait Flow Shop Scheduling

Abstract:

Constraint simplified mixed integer programming model was presented based on time transformation mechanism of no-wait flow shop. And a hybrid intelligence algorithm which combines the advantages of heuristic algorithm and neighborhood search algorithm was proposed. The initial population was generated by Johnson method, NEH method, Rajendran Method, Dannerbring method, and heuristic rules. The crossover and mutation operators in each generation were introduce neighborhood search (NS) and tabu search (TS). And the optimal individual was reserved in each generation. We compared the new hybrid intelligence algorithm (abbreviation H&NSGA ) with the algorithm blending heuristic and GA (NSGA), the algorithm blending neighborhood search and GA (HAGA), GA with the optimal individual reserved, and results show that the results and stability of solutions based on H&NSGA are better than the other three algorithms.

• Periodical: Advanced Materials Research (Volumes 712-715)
• Pages: 2447-2451
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.712-715.2447
• Online since: June 2013
• Authors: Fang Wang*, Yun Qing Rao, Qiu Hua Tang
• Keywords: Heuristic Algorithm , Hybrid Intelligence Algorithm, No-Wait Flow Shop Problem

References

[1] F.C. Cetinkaya: Int. J. Adv. Manuf. Technol., 29(2006), pp.178-183.

[2] T. Aldowaisan, A. Allahverdi: Omega, 32(2004), pp.345-352.

[3] L. Wang, in: Shop scheduling with genetic algorithms (in chinese), Tsinghua University Press, 2003.

[4] K.C. Ying, S.W. Lin, Z.J. Lee: Int. J. Adv. Manuf. Technol., 41 (2009), p.358–366.

[5] G. Sheen, L. Liao: Inter. J. of Advanced Manufacturing Technology, 36(2008), pp.132-139.

[6] J. Grabowski, J. Pempera: J. of Operational Research Society, 52(2001), pp.210-220.

[7] F.A. Ogbu, D.K. Smith: Computers and Operations Research, 17(1990), pp.243-253.

[8] C.R. Reeves, T. Yamada: Evolutionary Computation, 6(1998), pp.45-60.