{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T22:51:53Z","timestamp":1780613513482,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"S5","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10586-017-1420-4","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T01:55:06Z","timestamp":1517363706000},"page":"11561-11572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5503-9178","authenticated-orcid":false,"given":"Guohui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohui","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongcheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"4","key":"1420_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"issue":"4","key":"1420_CR2","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38(4), 3563\u20133573 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"1420_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40092-017-0204-z","volume":"1","author":"HE Nouri","year":"2017","unstructured":"Nouri, H.E., Driss, O.B., Gh\u00e9dira, K.: Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model. J. Ind. Eng. Int. 1(1), 1\u201314 (2017)","journal-title":"J. Ind. Eng. Int."},{"key":"1420_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 48, 409\u201325 (2005)","journal-title":"Comput. Ind. Eng."},{"issue":"104","key":"1420_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cie.2016.12.020","volume":"2017","author":"C Lu","year":"2017","unstructured":"Lu, C., Li, X., Gao, L., et al.: An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Comput. Ind. Eng. 2017(104), 156\u2013174 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"1420_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.procs.2015.09.207","volume":"61","author":"L Sun","year":"2015","unstructured":"Sun, L., Lin, L., Wang, Y., et al.: A bayesian optimization-based evolutionary algorithm for flexible job shop scheduling. Proced. Comput. Sci. 61, 521\u2013526 (2015)","journal-title":"Proced. Comput. Sci."},{"issue":"7","key":"1420_CR7","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13(7), 3259\u20133272 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"1420_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cie.2013.02.022","volume":"65","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H.: Flexible job shop scheduling using hybrid differential evolution algorithms. Comput. Ind. Eng. 65(2), 246\u2013260 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"1420_CR9","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1016\/j.cor.2013.06.010","volume":"40","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H.: An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput. Oper. Res. 40(12), 2864\u20132877 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"1420_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00170-011-3610-1","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, G., Xu, Y., et al.: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. 60(1\u20134), 303\u2013315 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1420_CR11","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","volume":"41","author":"S Karimi","year":"2017","unstructured":"Karimi, S., Ardalan, Z., Naderi, B., et al.: Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl. Math. Model. 41, 667\u2013682 (2017)","journal-title":"Appl. Math. Model."},{"key":"1420_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93\u2013110 (2016)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"1420_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11227-013-0986-8","volume":"67","author":"M Ziaee","year":"2014","unstructured":"Ziaee, M.: A heuristic algorithm for the distributed and flexible job-shop scheduling problem. J. Supercomput. 67(1), 69\u201383 (2014)","journal-title":"J. Supercomput."},{"issue":"9","key":"1420_CR14","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892\u20132907 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"19","key":"1420_CR15","doi-asserted-by":"publisher","first-page":"5671","DOI":"10.1080\/00207540903055743","volume":"48","author":"M Amiri","year":"2010","unstructured":"Amiri, M., Zandieh, M., Yazdani, M., et al.: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. Int. J. Prod. Res. 48(19), 5671\u20135689 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"11","key":"1420_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"9\u201312","key":"1420_CR17","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1007\/s00170-013-5354-6","volume":"70","author":"MA Adibi","year":"2014","unstructured":"Adibi, M.A., Shahrabi, J.: A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem. Int. J. Adv. Manuf. Technol. 70(9\u201312), 1955\u20131961 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"1420_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","volume":"40","author":"B Jarboui","year":"2013","unstructured":"Jarboui, B., Derbel, H., Hanafi, S., et al.: Variable neighborhood search for location routing. Comput. Oper. Res. 40(1), 47\u201357 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1420_CR19","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis, Y., Migdalas, A., Sifaleras, A.: A hybrid particle swarm optimization\u2014variable neighborhood search algorithm for constrained shortest path problems. Eur. J. Oper. Res. 261(3), 819\u2013834 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1420_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, Jos\u00e9 J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. Part B 52, 209\u2013219 (2014)","journal-title":"Comput. Oper. Res. Part B"},{"key":"1420_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.cor.2013.04.015","volume":"52","author":"N Mladenovi\u0107","year":"2014","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Two level general variable neighborhood search for attractive traveling salesman problem. Comput. Oper. Res. Part B 52, 341\u2013348 (2014)","journal-title":"Comput. Oper. Res. Part B"},{"key":"1420_CR22","volume-title":"Scheduling Theory, Algorithms, and Systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ (2002). (Chapter 2)"},{"issue":"4","key":"1420_CR23","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang, G., Shao, X., Li, P., et al.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56(4), 1309\u20131318 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"1420_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1\u201313 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"1420_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3), 245\u2013276 (2002)","journal-title":"Math. Comput. Simul."},{"issue":"3","key":"1420_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."}],"updated-by":[{"DOI":"10.1007\/s10586-018-2328-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000}}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-017-1420-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-1420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T17:11:37Z","timestamp":1574356297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-017-1420-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,31]]},"references-count":26,"journal-issue":{"issue":"S5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1420"],"URL":"https:\/\/doi.org\/10.1007\/s10586-017-1420-4","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10586-018-2328-3","asserted-by":"object"}]},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,31]]},"assertion":[{"value":"10 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2018","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original version of this article unfortunately contained a mistake in the acknowledgement statement. It should read as follow \u201cThis paper presents work funded by the National Natural Science Foundation of China (No. 61203179), Excellent Youth Foundation of Science & Technology Innovation of Henan Province (No. 184100510001), and Key scientific research projects of Henan Province (No. 182102210457). Also, we would like to thank the Collaborative Innovation Center for Aviation Economy Development of Henan Province.\u201d.The oricd of the corresponding author is revised to http:\/\/orcid.org\/0000-0001-9143-2922. Also the e-mail of the corresponding author is revised to zgh_hust@qq.com.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}