Local Search Optimization Immune Algorithm Based on Job Insert Method for HFSS


Article Preview

Hybrid flow shop (HFS), as a production organization mode with characteristics of high flexibility, low cost and quick replacement job, has attracted extensive attention of research units and enterprises. In order to resolve the complex HFS scheduling optimization problem, an improved immune scheduling algorithm (ISA) model is proposed in this paper. A local search optimization algorithm,which can optimize the scheduling instance, accelerate the convergence of ISA, and improve scheduling results eventually, is adopted in the model on the basis of the job insert method. The results which simulate the manufacturing model of a camshaft enterprise show that the improved algorithm model is effective.



Edited by:

Yanwen Wu




Z. F. Liu et al., "Local Search Optimization Immune Algorithm Based on Job Insert Method for HFSS", Advanced Materials Research, Vol. 267, pp. 947-952, 2011

Online since:

June 2011




[1] Gupta J N D. Two-stage hybrid flow shop scheduling problem [J]. Journal of Operational Research Society, 1988, 34(4): 359~364.

[2] Brah, S.A.; Loo L. L. Heuristics for scheduling in a flow shop with multiple processors [J]. European Journal of Operational Research, 1999, 113(1): 113~122.

DOI: https://doi.org/10.1016/s0377-2217(97)00423-2

[3] Bertel, S.; Billaut, J.C. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation [J]. European Journal of Operational Research, 2004, 159(3): 651~662.

DOI: https://doi.org/10.1016/s0377-2217(03)00434-x

[4] Engin, O.; Doyen, A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system [J]. Future Generation Computer Systems, 2004, 20(6): 1084~1095.

DOI: https://doi.org/10.1016/j.future.2004.03.014

[5] Tang, L.; Xuan, H. Lagrangian relaxation algorithms for real-time hybrid flow shop scheduling with finite intermediate buffers [J]. Journal of the Operational Research Society, 2006, 57(3): 316~324.

DOI: https://doi.org/10.1057/palgrave.jors.2602033

Fetching data from Crossref.
This may take some time to load.