{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T14:37:45Z","timestamp":1770129465748,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030953836","type":"print"},{"value":"9783030953843","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_18","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"271-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["AHOA: Adaptively Hybrid Optimization Algorithm for\u00a0Flexible Job-shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jiaxin","family":"Ye","sequence":"first","affiliation":[]},{"given":"Dejun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Haokai","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Yongxuan","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Min","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"19","key":"18_CR1","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., Bagheri, A.: 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":"3","key":"18_CR2","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."},{"issue":"4","key":"18_CR3","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":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen, R., Yang, B., Li, S., Wang, S.: A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput. Ind. Eng. 149, 106778 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1109\/TII.2019.2933443","volume":"16","author":"P Dai","year":"2019","unstructured":"Dai, P., Yu, W., Wen, G., Baldi, S.: Distributed reinforcement learning algorithm for dynamic economic dispatch with unknown generation cost functions. IEEE Trans. Ind. Inf. 16(4), 2258\u20132267 (2019)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L De Giovanni","year":"2010","unstructured":"De Giovanni, L., Pezzella, F.: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200(2), 395\u2013408 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"18_CR8","first-page":"265","volume":"5","author":"K Deb","year":"1999","unstructured":"Deb, K., Agrawal, S.: Understanding interactions among genetic algorithm parameters. Found. Genet. Algorithms 5(5), 265\u2013286 (1999)","journal-title":"Found. Genet. Algorithms"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.neucom.2020.07.004","volume":"414","author":"H Ding","year":"2020","unstructured":"Ding, H., Gu, X.: Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem. Neurocomputing 414, 313\u2013332 (2020)","journal-title":"Neurocomputing"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"104951","DOI":"10.1016\/j.cor.2020.104951","volume":"121","author":"H Ding","year":"2020","unstructured":"Ding, H., Gu, X.: Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput. Oper. Res. 121, 104951 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TIE.2013.2257135","volume":"61","author":"Y Du","year":"2013","unstructured":"Du, Y., Fang, J., Miao, C.: Frequency-domain system identification of an unmanned helicopter based on an adaptive genetic algorithm. IEEE Trans. Ind. Electron. 61(2), 870\u2013881 (2013)","journal-title":"IEEE Trans. Ind. Electron."},{"key":"18_CR12","unstructured":"Gao, L., Peng, C., Zhou, C., Li, P.: Solving flexible job shop scheduling problem using general particle swarm optimization. In: Proceedings of the 36th CIE Conference on Computers & Industrial Engineering, pp. 3018\u20133027. Citeseer (2006)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1080\/00207543.2017.1388933","volume":"56","author":"X Gong","year":"2018","unstructured":"Gong, X., Deng, Q., Gong, G., Liu, W., Ren, Q.: A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. Int. J. Prod. Res. 56(7), 2506\u20132522 (2018)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/opre.29.4.646","volume":"29","author":"SC Graves","year":"1981","unstructured":"Graves, S.C.: A review of production scheduling. Oper. Res. 29(4), 646\u2013675 (1981)","journal-title":"Oper. Res."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Han, B., Yang, J.: A deep reinforcement learning based solution for flexible job shop scheduling problem. Int. J. Simul. Model. (IJSIMM) 20(2), 375\u2013386 (2021)","DOI":"10.2507\/IJSIMM20-2-CO7"},{"key":"18_CR17","first-page":"2613","volume":"23","author":"H Hasselt","year":"2010","unstructured":"Hasselt, H.: Double q-learning. Adv. Neural Inf. Process. Syst. 23, 2613\u20132621 (2010)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Ho, N.B., Tay, J.C.: Genace: an efficient cultural algorithm for solving the flexible job-shop problem. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753), vol. 2, pp. 1759\u20131766. IEEE (2004)","DOI":"10.1109\/CEC.2004.1331108"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Hu, S., Zhou, L.: Research on flexible job-shop scheduling problem based on the dragonfly algorithm. In: 2020 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA), pp. 241\u2013245. IEEE (2020)","DOI":"10.1109\/AIEA51086.2020.00058"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TCYB.2015.2502483","volume":"47","author":"M Jiang","year":"2015","unstructured":"Jiang, M., Huang, W., Huang, Z., Yen, G.G.: Integration of global and local metrics for domain adaptation learning via dimensionality reduction. IEEE Trans. Cybern. 47(1), 38\u201351 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/TEVC.2017.2771451","volume":"22","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Huang, Z., Qiu, L., Huang, W., Yen, G.G.: Transfer learning-based dynamic multiobjective optimization algorithms. IEEE Trans. Evol. Comput. 22(4), 501\u2013514 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ins.2017.12.058","volume":"435","author":"M Jiang","year":"2018","unstructured":"Jiang, M., Qiu, L., Huang, Z., Yen, G.G.: Dynamic multi-objective estimation of distribution algorithm based on domain adaptation and nonparametric estimation. Inf. Sci. 435, 203\u2013223 (2018)","journal-title":"Inf. Sci."},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, M., Wang, Z., Guo, S., Gao, X., Tan, K.C.: Individual-based transfer learning for dynamic multiobjective optimization. IEEE Trans. Cybern. 51(10), 4968\u20134981 (2021)","DOI":"10.1109\/TCYB.2020.3017049"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2020.3004027","volume":"25","author":"M Jiang","year":"2020","unstructured":"Jiang, M., Wang, Z., Hong, H., Yen, G.G.: Knee point-based imbalanced transfer learning for dynamic multiobjective optimization. IEEE Trans. Evol. Comput. 25(1), 117\u2013129 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Jiang, M., Wang, Z., Qiu, L., Guo, S., Gao, X., Tan, K.C.: A fast dynamic evolutionary multiobjective algorithm via manifold transfer learning. IEEE Trans. Cybern. 51(7), 3417\u20133428 (2021)","DOI":"10.1109\/TCYB.2020.2989465"},{"key":"18_CR26","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."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.cie.2015.04.029","volume":"87","author":"B Liu","year":"2015","unstructured":"Liu, B., Fan, Y., Liu, Y.: A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem. Comput. Ind. Eng. 87, 193\u2013201 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10845-015-1083-z","volume":"29","author":"P-H Lu","year":"2018","unstructured":"Lu, P.-H., Wu, M.-C., Tan, H., Peng, Y.-H., Chen, C.-F.: A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems. J. Intell. Manuf. 29(1), 19\u201334 (2018). https:\/\/doi.org\/10.1007\/s10845-015-1083-z","journal-title":"J. Intell. Manuf."},{"issue":"11","key":"18_CR29","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."},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.trc.2018.12.018","volume":"99","author":"X Qi","year":"2019","unstructured":"Qi, X., Luo, Y., Wu, G., Boriboonsomsin, K., Barth, M.: Deep reinforcement learning enabled self-learning control for energy efficient driving. Transp. Res. Part C Emerg. Technol. 99, 67\u201381 (2019)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"18_CR31","unstructured":"Rangel-Merino, A., L\u00f3pez-Bonilla, J., y Miranda, R.L.: Optimization method based on genetic algorithms. Apeiron 12(4), 393\u2013408 (2005)"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Wang, Y., Song, Y.C., Zou, Y.J., Lei, Q., Wang, X.K.: A hybrid gray wolf weed algorithm for flexible job-shop scheduling problem. In: Journal of Physics: Conference Series, vol. 1828, p. 012162. IOP Publishing (2021)","DOI":"10.1088\/1742-6596\/1828\/1\/012162"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"104864","DOI":"10.1109\/ACCESS.2021.3096007","volume":"9","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Zhu, Q.: A hybrid genetic algorithm for flexible job shop scheduling problem with sequence-dependent setup times and job lag times. IEEE Access 9, 104864\u2013104873 (2021)","journal-title":"IEEE Access"},{"issue":"2","key":"18_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994)","journal-title":"Stat. Comput."},{"issue":"4","key":"18_CR35","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., Gao, L.: 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."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95384-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:08:00Z","timestamp":1726704480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}