{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:13:52Z","timestamp":1743138832195,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819947546"},{"type":"electronic","value":"9789819947553"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4755-3_21","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T00:02:38Z","timestamp":1690675358000},"page":"241-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Variable Neighborhood Search Algorithm for Solving the Energy-Efficient Flexible Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Ying","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi-Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,30]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Mouzon, G., Yildirim, M.B., Twomey, J.: Operational methods for minimization of energy consumption of manufacturing equipment. Int. J. Prod. Res. 45(18\u201319), 4247\u20134271 (2007)","DOI":"10.1080\/00207540701450013"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Meng, L.-l., Zhang, C., Shao, X., Ren, Y.: MILP models for energy-aware flexible job shop scheduling problem. J. Clean. Prod. (2019)","DOI":"10.1016\/j.jclepro.2018.11.021"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Lin, C.-S., Li, P.-Y., Wei, J.-M., Wu, M.-C.: Integration of process planning and scheduling for distributed flexible job shops. Comput. Oper. Res. 124, 105053 (2020)","DOI":"10.1016\/j.cor.2020.105053"},{"key":"21_CR4","unstructured":"Wu, X., Liu, X.,  Zhao, N.: An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem. Memet. Comput., 1\u201321 (2019)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Luo, Q., Deng, Q.W., Gong, G.L., Zhang, L.K., Han, W.W.,  Li, K.X.: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst. Appl. 160(1), 113721 (2020)","DOI":"10.1016\/j.eswa.2020.113721"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Sun, J., Zhang, G., Lu, J., Zhang, W.: A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times. Comput. Oper. Res. 132, 105263 (2021)","DOI":"10.1016\/j.cor.2021.105263"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Wu, X., Sun, Y.: A green scheduling algorithm for flexible job shop with energy-saving measures. J. Clean. Prod. 172, 3249\u20133264 (2018)","DOI":"10.1016\/j.jclepro.2017.10.342"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Li, Y.,  Huang, W., Wu, R., Guo, K.: An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl. Soft Comput. 95, 106544 (2020)","DOI":"10.1016\/j.asoc.2020.106544"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Wei, Z.,  Liao, W., Zhang, L.: Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds. Expert Syst. Appl. 197, 116785 (2022)","DOI":"10.1016\/j.eswa.2022.116785"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 36(9), 2638\u20132646 (2009)","DOI":"10.1016\/j.cor.2008.11.004"},{"key":"21_CR12","unstructured":"Wang, F.,  Tang, Q., Rao, Y.Q., Zhang, C., Zhang, L.: Efficient estimation of distribution for flexible hybrid flow shop scheduling. Zidonghua Xuebao 43, 280\u2013293 (2017)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, Z.Q., Qian, B., Hu,  R., Jin, H.P., Wang, L.: A matrix-cube-based estimation of distribution algorithm for the distributed assembly permutation flow-shop scheduling problem. Swarm Evol. Comput. 60(1), 100785 (2021)","DOI":"10.1016\/j.swevo.2020.100785"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Qian, B., Zhang,  Z.Q., Hu, R.,  Jin, H.P., Yang, J.B.: A matrix-cube-based estimation of distribution algorithm for no-wait flow-shop scheduling with sequence-dependent setup times and release times. IEEE Trans. Syst. Man Cybern. 1\u201312 (2022)","DOI":"10.2139\/ssrn.4053288"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Guo, N., Qian, B., Na,  J.-X., Hu,  R., Mao, J.L.: A three-dimensional ant colony optimization algorithm for multi-compartment vehicle routing problem considering carbon emissions. Appl. Soft Comput. 127, 109326 (2022)","DOI":"10.1016\/j.asoc.2022.109326"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","DOI":"10.1109\/4235.996017"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhou, G., Xu,  Y., Liu, M.: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int. J. Prod. Res. 51 (2013)","DOI":"10.1080\/00207543.2012.754549"},{"key":"21_CR18","unstructured":"Chandra, S.: Design and Analysis of Experiments. Publishing (2005)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157\u2013183 (1993)","DOI":"10.1007\/BF02023073"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Luo, Q., Deng,  Q., Gong, G., Zhang, L., Han, W., Li, K.: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst. Appl. 160, 113721 (2020)","DOI":"10.1016\/j.eswa.2020.113721"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4755-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:19:02Z","timestamp":1690931942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4755-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947546","9789819947553"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4755-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}