{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:09:17Z","timestamp":1762340957789},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T00:00:00Z","timestamp":1477008000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Talented Young Scholars Growth Plan of Liaoning Province Education Department, China","award":["LJQ2013048"],"award-info":[{"award-number":["LJQ2013048"]}]},{"name":"the Scientific Project of Liaoning Province Education Department, China","award":["L2014183"],"award-info":[{"award-number":["L2014183"]}]},{"name":"the Project of Liaoning BaiQianWan Talents Program, China","award":["2014921062"],"award-info":[{"award-number":["2014921062"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s12652-016-0425-9","type":"journal-article","created":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T23:39:23Z","timestamp":1477006763000},"page":"165-171","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Flexible job shop scheduling based on improved hybrid immune algorithm"],"prefix":"10.1007","volume":"9","author":[{"given":"Xu","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,21]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.cor.2015.10.012","volume":"67","author":"DY Bai","year":"2016","unstructured":"Bai DY, Zhang ZH, Zhang Q (2016) Flexible open shop scheduling problem to minimize makespan. Comput Oper Res 67:207\u2013215","journal-title":"Comput Oper Res"},{"key":"425_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157\u2013183","journal-title":"Ann Oper Res"},{"issue":"24","key":"425_CR3","first-page":"76","volume":"289","author":"KZ Gao","year":"2014","unstructured":"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\u201390","journal-title":"Inf Sci"},{"issue":"6","key":"425_CR4","doi-asserted-by":"crossref","first-page":"1631","DOI":"10.1007\/s00521-012-1119-7","volume":"23","author":"F Geyik","year":"2013","unstructured":"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\u20131641","journal-title":"Neural Comput Appl"},{"key":"425_CR5","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.knosys.2010.07.010","volume":"24","author":"C Gutierrez","year":"2011","unstructured":"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\u2013112","journal-title":"Knowl Based Syst"},{"key":"425_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"XY Li","year":"2016","unstructured":"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\u2013110","journal-title":"Int J Prod Econ"},{"issue":"7","key":"425_CR7","first-page":"1495","volume":"17","author":"XL Li","year":"2011","unstructured":"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\u20131500","journal-title":"Comput Integr Manuf Syst"},{"issue":"2","key":"425_CR8","first-page":"495","volume":"21","author":"XB Liu","year":"2015","unstructured":"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\u2013502","journal-title":"Comput Integr Manuf Syst"},{"issue":"2","key":"425_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jsir.2011040101","volume":"2","author":"Rafael Mart\u00ed","year":"2011","unstructured":"Mart\u00ed Rafael, Pantrigo Juan-Jos\u00e9, 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\u201321","journal-title":"Int J Swarm Intell Res"},{"issue":"19","key":"425_CR10","doi-asserted-by":"crossref","first-page":"5851","DOI":"10.1080\/00207543.2010.523724","volume":"49","author":"H Mokhtari","year":"2011","unstructured":"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\u20135875","journal-title":"Int J Prod Res"},{"key":"425_CR11","unstructured":"Ning T (2013) Study of application of hybrid quantum algorithm in vehicle routing problem. Dalian Maritime University, Dalian"},{"key":"425_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2174\/1874110X01610010013","volume":"10","author":"T Ning","year":"2016","unstructured":"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\u201319","journal-title":"Open Cyvernetics Syst J"},{"issue":"5","key":"425_CR13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s12652-016-0370-7","volume":"7","author":"T Ning","year":"2016","unstructured":"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\u2013729","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"425_CR14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","volume":"54","author":"JJ Palacios","year":"2015","unstructured":"Palacios JJ et al (2015) Genetic tabu search for the fuzzy flexible job shop problem. Comput Op Res 54:74\u201389","journal-title":"Comput Op Res"},{"issue":"3","key":"425_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4018\/ijaec.2014070104","volume":"5","author":"S Prakash","year":"2014","unstructured":"Prakash S, Vidyarthi DP (2014) A hybrid GABFO scheduling for optimal makespan in computational grid. Int J Appl Evol Comput 5(3):57\u201383","journal-title":"Int J Appl Evol Comput"},{"issue":"5","key":"425_CR16","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s00170-012-4051-1","volume":"64","author":"SHM Rahmati","year":"2013","unstructured":"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\u2013932","journal-title":"Int J Adv Manuf Technol"},{"issue":"9","key":"425_CR17","doi-asserted-by":"crossref","first-page":"10812","DOI":"10.1016\/j.eswa.2011.02.050","volume":"38","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"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\u201310821","journal-title":"Expert Syst Appl"},{"issue":"10","key":"425_CR18","first-page":"2843","volume":"9","author":"HQ Xue","year":"2014","unstructured":"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\u20132850","journal-title":"J Netw"},{"issue":"4","key":"425_CR19","first-page":"854","volume":"20","author":"SK Zhao","year":"2014","unstructured":"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\u2013865","journal-title":"Comput Integr Manuf Syst"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-016-0425-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-016-0425-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-016-0425-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,26]],"date-time":"2018-01-26T22:50:58Z","timestamp":1517007058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-016-0425-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,21]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s12652-016-0425-9","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,21]]}}}