{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:13:29Z","timestamp":1768436009706,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T00:00:00Z","timestamp":1492387200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation, China","doi-asserted-by":"crossref","award":["No. 51579024"],"award-info":[{"award-number":["No. 51579024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Dr scientific research fund of Liaoning Province in China","award":["201601244"],"award-info":[{"award-number":["201601244"]}]},{"name":"Liaoning Provincial Social Science Planning Foundation of China","award":["L16BGL008"],"award-info":[{"award-number":["L16BGL008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s12652-017-0486-4","type":"journal-article","created":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T01:35:13Z","timestamp":1492392913000},"page":"931-940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An improved quantum genetic algorithm based on MAGTD for dynamic FJSP"],"prefix":"10.1007","volume":"9","author":[{"given":"Tao","family":"Ning","sequence":"first","affiliation":[]},{"given":"Hua","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Xudong","family":"Song","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,17]]},"reference":[{"issue":"4","key":"486_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandith M, Mahdavi I, Yanzdanni M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comp Syst 26(4):533\u2013541","journal-title":"Future Gener Comp Syst"},{"issue":"3","key":"486_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(3):157\u2013183","journal-title":"Ann Oper Res"},{"issue":"4","key":"486_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Bucker","year":"1990","unstructured":"Bucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369\u2013375","journal-title":"Computing"},{"issue":"2","key":"486_CR4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.cirpj.2009.10.001","volume":"2","author":"P Fattahi","year":"2010","unstructured":"Fattahi P, Fallahi A (2010) Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability. CIRP J Manuf Sci Technol 2(2):114\u2013123","journal-title":"CIRP J Manuf Sci Technol"},{"issue":"3","key":"486_CR5","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flow shop scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 28(3):392\u2013403","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"issue":"3","key":"486_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/nav.3800040404","volume":"4","author":"JR Jackson","year":"1957","unstructured":"Jackson J R (1957) Simulation research on job shop production. Naval Res Logist Q 4(3):287\u2013295","journal-title":"Naval Res Logist Q"},{"issue":"1","key":"486_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cyb C 32(1):1\u201313","journal-title":"IEEE Trans Syst Man Cyb C"},{"key":"486_CR8","first-page":"250","volume":"5","author":"X Liu","year":"2014","unstructured":"Liu X, Zhang G (2014) Flexible job shop dynamic scheduling method research. Mach Des Manuf 5:250\u2013252+256","journal-title":"Mach Des Manuf"},{"issue":"9","key":"486_CR9","first-page":"1954","volume":"17","author":"A Liu","year":"2011","unstructured":"Liu A, Yang Y, Xing Q et al (2011) Multi-population genetic algorithm in multi-objective fuzzy and flexible Job Shop scheduling Dynamic scheduling on multi-objective flexible Job Shop. Comput Integr Manuf Syst 17(9):1954\u20131961","journal-title":"Comput Integr Manuf Syst"},{"issue":"12","key":"486_CR10","first-page":"1","volume":"7","author":"X Liu","year":"2014","unstructured":"Liu X, Jiao X, Ning T et al (2014) Improved method of flexible Job Shop scheduling based on double chains quantum genetic algorithm. Comput Integr Manuf Syst 7(12):1\u201311","journal-title":"Comput Integr Manuf Syst"},{"key":"486_CR11","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 et al (2016a) A novel hybrid method for solving flexible job-shop scheduling problem. Open Cybern Syst J 10:13\u201319","journal-title":"Open Cybern Syst J"},{"issue":"7","key":"486_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s12652-016-0370-7","volume":"25","author":"T Ning","year":"2016","unstructured":"Ning T, Huang M, Liang X et al (2016b) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Humaniz Comput 25(7):721\u2013729","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"10","key":"486_CR13","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202\u20133212","journal-title":"Comput Oper Res"},{"issue":"5","key":"486_CR14","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s00170-012-4051-1","volume":"64","author":"SHA Rahmat","year":"2013","unstructured":"Rahmat SHA, 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":"12","key":"486_CR15","first-page":"188","volume":"48","author":"J Shi","year":"2012","unstructured":"Shi J, Jiao H, Chen T (2012) Multi-objective Pareto optimization on flexible job-shop scheduling problem about due punishment. J Mech Eng 48(12):188\u2013196","journal-title":"J Mech Eng"},{"key":"486_CR16","volume-title":"Research of scheduling problems based on hybrid evolutionary algorithm","author":"J Tang","year":"2012","unstructured":"Tang J (2012) Research of scheduling problems based on hybrid evolutionary algorithm. South China University of Technology, Guangzhou"},{"issue":"14","key":"486_CR17","first-page":"1","volume":"7","author":"S Wang","year":"2014","unstructured":"Wang S, Zhang C, Liu Q et al (2014) Dynamic scheduling of flexible job shop based on different rescheduling cycle. Comput Integr Manuf Syst 7(14):1\u201314","journal-title":"Comput Integr Manuf Syst"},{"key":"486_CR18","first-page":"348","volume":"2","author":"K Yang","year":"2009","unstructured":"Yang K, Liu X (2009) Multi-objective optimization for flow shop scheduling with the group technology assumption removed. Comput Integr Manuf Syst 2:348\u2013357","journal-title":"Comput Integr Manuf Syst"},{"key":"486_CR19","unstructured":"Zhang L (2013) Research on theories and methods for dynamic job shop scheduling based on predictive-reactive scheduling. Huazhong University of Science and Technology, Wuhan"},{"issue":"6","key":"486_CR20","first-page":"30","volume":"29","author":"J Zhang","year":"2012","unstructured":"Zhang J, Wang W, Xu X et al (2012) Hybrid particle-swarm optimization for multi- objective flexible job-shop scheduling problem. Control Theory Appl 29(6):30\u201337","journal-title":"Control Theory Appl"},{"issue":"12","key":"486_CR21","doi-asserted-by":"crossref","first-page":"3516","DOI":"10.1080\/00207543.2012.751509","volume":"51","author":"L Zhang","year":"2013","unstructured":"Zhang L, Gao L, Li X (2013) A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem. Int J Prod Res 51(12):3516\u20133531","journal-title":"Int J Prod Res"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-017-0486-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-017-0486-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-017-0486-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T09:13:45Z","timestamp":1532942025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-017-0486-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,17]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["486"],"URL":"https:\/\/doi.org\/10.1007\/s12652-017-0486-4","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,17]]}}}