Abstract
An improved hybrid immune algorithm (HIA) with parallelism and adaptability is proposed to solve the flexible job shop scheduling problem. In order to represent the actual characteristics of the problem’s solution, in the algorithm the author uses a hybrid encoding method of piece—machine. Firstly, adaptive crossover operator and mutation operator are designed based on the encoding antibody method and the affinity calculation based on group matching is adopted. Secondly, the algorithm uses adaptive crossover probability and mutation probability in the operation of immune for the antibody population. The new antibody after crossing can automatically meet the constraints of the problem. Next, a hybrid algorithm based on simulated annealing algorithm is introduced to avoid the local optimization in this paper. Finally, it is demonstrated the effectiveness of the proposed algorithm through the simulation and comparison with some existing algorithms.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bai DY, Zhang ZH, Zhang Q (2016) Flexible open shop scheduling problem to minimize makespan. Comput Oper Res 67:207–215
Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183
Gao KZ, Suganthan PN, Pan QK et al (2014) Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf Sci 289(24):76–90
Geyik F, Dosdogru AT (2013) Process plan and part routing optimization in a dynamic flexible job shop scheduling environment an optimization via simulation approach. Neural Comput Appl 23(6):1631–1641
Gutierrez C, Garcia-Magario I (2011) Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem. Knowl Based Syst 24:102–112
Li XY, Liang G (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110
Li XL, Lu JS, Chuai Guo-zhong GZ et al (2011) Hybrid bee colony algorithm for flexible Job Shop scheduling problem. Comput Integr Manuf Syst 17(7):1495–1500
Liu XB, JIAO X, Ning T et al (2015) Improved method of flexible Job Shop scheduling based on double chains quantum genetic algorithm. Comput Integr Manuf Syst 21(2):495–502
Martí Rafael, Pantrigo Juan-José, Duarte Abraham et al (2011) Scatter search and path relinking: a turorial on the linear arrangement problem. Int J Swarm Intell Res 2(2):1–21
Mokhtari H, Abadi INK, Cheraghalikhania A (2011) A multi-objective flow shop scheduling with resource-de-pendent processing times: trade-off between makespan and cost of resources. Int J Prod Res 49(19):5851–5875
Ning T (2013) Study of application of hybrid quantum algorithm in vehicle routing problem. Dalian Maritime University, Dalian
Ning T, Guo C, Chen R, JIN H (2016a) A novel hybrid method for solving flexible job-shop scheduling problem. Open Cyvernetics Syst J 10:13–19
Ning T, Huang M, Liang X, Jin H (2016b) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Humaniz Comput 7(5):721–729
Palacios JJ et al (2015) Genetic tabu search for the fuzzy flexible job shop problem. Comput Op Res 54:74–89
Prakash S, Vidyarthi DP (2014) A hybrid GABFO scheduling for optimal makespan in computational grid. Int J Appl Evol Comput 5(3):57–83
Rahmati SHM, Zandieh M, Yazdani M (2013) Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol 64(5):915–932
Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) A new hybrid multi-objective pareto archive PSO algorithm for a bi-objective job shop scheduling problem. Expert Syst Appl 38(9):10812–10821
Xue HQ, Zhang P, Wei SM, Yang L (2014) An improved immune algorithm for multi-objective flexible job-shop scheduling. J Netw 9(10):2843–2850
Zhao SK, Fang SL, Gu XJ (2014) Machine selection and FJSP solution based on limit scheduling completion time minimization. Comput Integr Manuf Syst 20(4):854–865
Acknowledgments
This work is partially supported by the Talented Young Scholars Growth Plan of Liaoning Province Education Department, China (No. LJQ2013048), the Dr scientific research fund of Liaoning Province (No. 201601244) and the Project of Liaoning BaiQianWan Talents Program, China (No. 2014921062).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, X., Huang, M. & Ning, T. Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Human Comput 9, 165–171 (2018). https://doi.org/10.1007/s12652-016-0425-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-016-0425-9