{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:49:50Z","timestamp":1765828190619,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71922009"],"award-info":[{"award-number":["71922009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871080"],"award-info":[{"award-number":["71871080"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-022-01886-6","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T15:03:36Z","timestamp":1652108616000},"page":"955-980","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhanyin","family":"Li","sequence":"first","affiliation":[]},{"given":"Jun","family":"Pei","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Ya","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,9]]},"reference":[{"issue":"1","key":"1886_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1010949931021","volume":"102","author":"J Alcaraz","year":"2001","unstructured":"Alcaraz, J., Maroto, C.: A robust genetic algorithm for resource allocation in project scheduling[J]. Annal. Op. Res. 102(1), 83\u2013109 (2001)","journal-title":"Annal. Op. Res."},{"key":"1886_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2018.04.044","volume":"453","author":"X Bai","year":"2018","unstructured":"Bai, X., Yan, W., Ge, S.S., et al.: An integrated multi-population genetic algorithm for multi-vehicle task assignment in a drift field[J]. Inf. Sci. 453, 227\u2013238 (2018)","journal-title":"Inf. Sci."},{"issue":"2","key":"1886_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2019.09.052","volume":"291","author":"N Balouka","year":"2021","unstructured":"Balouka, N., Cohen, I.: A robust optimization approach for the multi-mode resource-constrained project scheduling problem[J]. Eur. J. Op. Res. 291(2), 457\u2013470 (2021)","journal-title":"Eur. J. Op. Res."},{"issue":"4","key":"1886_CR4","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s12667-020-00380-1","volume":"12","author":"Z Bektas","year":"2021","unstructured":"Bektas, Z., Kayal\u0131ca, M.O., Kayakutlu, G.: A hybrid heuristic algorithm for optimal energy scheduling of grid-connected micro grids[J]. Energy Syst. 12(4), 877\u2013893 (2021)","journal-title":"Energy Syst."},{"issue":"1","key":"1886_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2014.06.025","volume":"240","author":"U Be\u00e7sikci","year":"2015","unstructured":"Be\u00e7sikci, U., Bilge, \u00dc., Ulusoy, G.: Multi-mode resource constrained multi-project scheduling and resource portfolio problem[J]. Eur. J. Op. Res. 240(1), 22\u201331 (2015)","journal-title":"Eur. J. Op. Res."},{"issue":"3","key":"1886_CR6","first-page":"1369","volume":"20","author":"RK Chakrabortty","year":"2020","unstructured":"Chakrabortty, R.K., Sarker, R.A., Essam, D.L.: Single mode resource constrained project scheduling with unreliable resources[J]. Op. Res. 20(3), 1369\u20131403 (2020)","journal-title":"Op. Res."},{"key":"1886_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2017.12.013","volume":"432","author":"S Chand","year":"2018","unstructured":"Chand, S., Huynh, Q., Singh, H., et al.: On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems[J]. Inf. Sci. 432, 146\u2013163 (2018)","journal-title":"Inf. Sci."},{"issue":"1","key":"1886_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.mathsocsci.2011.04.004","volume":"62","author":"ER Gafarov","year":"2011","unstructured":"Gafarov, E.R., Lazarev, A.A., Werner, F.: Single machine scheduling problems with financial resource constraints: some complexity results and properties[J]. Math. Soc. Sci. 62(1), 7\u201313 (2011)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"1886_CR9","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ejor.2015.11.020","volume":"251","author":"R Gedik","year":"2016","unstructured":"Gedik, R., Rainwater, C., Nachtmann, H., et al.: Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals[J]. Eur. J. Op. Res. 251(2), 640\u2013650 (2016)","journal-title":"Eur. J. Op. Res."},{"issue":"2","key":"1886_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107, A., Uro\u0160evi\u0107, D., Brimberg, J., et al.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem[J]. Eur. J. Op. Res. 206(2), 289\u2013300 (2010)","journal-title":"Eur. J. Op. Res."},{"issue":"4","key":"1886_CR11","first-page":"2525","volume":"21","author":"W Jomaa","year":"2021","unstructured":"Jomaa, W., Eddaly, M., Jarboui, B.: Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance[J]. Op. Res. 21(4), 2525\u20132542 (2021)","journal-title":"Op. Res."},{"key":"1886_CR12","doi-asserted-by":"publisher","first-page":"119300","DOI":"10.1016\/j.jclepro.2019.119300","volume":"248","author":"M Kong","year":"2020","unstructured":"Kong, M., Pei, J., Liu, X., et al.: Green manufacturing: order acceptance and scheduling subject to the budgets of energy consumption and machine launch[J]. J. Cleaner Prod. 248, 119300 (2020)","journal-title":"J. Cleaner Prod."},{"issue":"2","key":"1886_CR13","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2017.07.027","volume":"265","author":"RL Kadri","year":"2018","unstructured":"Kadri, R.L., Boctor, F.F.: An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case[J]. Eur. J. Op. Res. 265(2), 454\u2013462 (2018)","journal-title":"Eur. J. Op. Res."},{"key":"1886_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.compchemeng.2011.06.007","volume":"36","author":"TS Kyriakidis","year":"2012","unstructured":"Kyriakidis, T.S., Kopanos, G.M., Georgiadis, M.C.: MILP formulations for single-and multi-mode resource-constrained project scheduling problems[J]. Computers Chem. Eng. 36, 369\u2013385 (2012)","journal-title":"Computers Chem. Eng."},{"issue":"4","key":"1886_CR15","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s10898-018-0687-1","volume":"78","author":"J Li","year":"2020","unstructured":"Li, J., Ge, B., Jiang, J., et al.: High-end weapon equipment portfolio selection based on a heterogeneous network model[J]. J. Global Optim. 78(4), 743\u2013761 (2020)","journal-title":"J. Global Optim."},{"key":"1886_CR16","doi-asserted-by":"publisher","first-page":"113195","DOI":"10.1016\/j.cam.2020.113195","volume":"384","author":"S Lu","year":"2021","unstructured":"Lu, S., Pei, J., Liu, X., et al.: A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities[J]. J. Comput. Appl. Math. 384, 113195 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1886_CR17","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2020.02.010","volume":"285","author":"G Mej\u00eda","year":"2020","unstructured":"Mej\u00eda, G., Yuraszeck, F.: A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel\/setup times[J]. Eur. J. Op. Res. 285(2), 484\u2013496 (2020)","journal-title":"Eur. J. Op. Res."},{"issue":"11","key":"1886_CR18","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0106","year":"1997","unstructured":"Mladenovi\u0106, N., Hansen, P.: Variable neighborhood search[J]. Computers Op. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Computers Op. Res."},{"key":"1886_CR19","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","volume":"507","author":"J Pei","year":"2020","unstructured":"Pei, J., Mladenovi\u0106, N., Uro\u0160evi\u0106, D., et al.: Solving the traveling repairman problem with profits: a novel variable neighborhood search approach[J]. Inf. Sci. 507, 108\u2013123 (2020)","journal-title":"Inf. Sci."},{"key":"1886_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10479-020-03555-2","volume":"298","author":"J Pei","year":"2021","unstructured":"Pei, J., Song, Q., Liao, B., et al.: Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration[J]. Annal. Op. Res. 298, 407\u2013444 (2021)","journal-title":"Annal. Op. Res."},{"issue":"10","key":"1886_CR21","first-page":"3770","volume":"50","author":"Y Ren","year":"2018","unstructured":"Ren, Y., Zhang, C., Zhao, F., et al.: An MCDM-based multiobjective general variable neighborhood search approach for disassembly line balancing problem[J]. IEEE Trans. Syst., Man, Cybern.: Syst. 50(10), 3770\u20133783 (2018)","journal-title":"IEEE Trans. Syst., Man, Cybern.: Syst."},{"key":"1886_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ijpe.2017.12.025","volume":"198","author":"D Shabtay","year":"2018","unstructured":"Shabtay, D., Zofi, M.: Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan[J]. Int. J. Prod. Econ. 198, 191\u2013200 (2018)","journal-title":"Int. J. Prod. Econ."},{"key":"1886_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2017.06.019","volume":"88","author":"B Shahidi-Zadeh","year":"2017","unstructured":"Shahidi-Zadeh, B., Tavakkoli-Moghaddam, R., Taheri-Moghadam, A., et al.: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study[J]. Computers Op. Res. 88, 71\u201390 (2017)","journal-title":"Computers Op. Res."},{"issue":"3","key":"1886_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0377-2217(81)90348-9","volume":"7","author":"R S\u0142owinski","year":"1981","unstructured":"S\u0142owinski, R.: Multiobjective network scheduling with efficient use of renewable and nonrenewable resources[J]. Eur. J. Op. Res. 7(3), 265\u2013273 (1981)","journal-title":"Eur. J. Op. Res."},{"issue":"4","key":"1886_CR25","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eng.2020.08.021","volume":"7","author":"Y Su","year":"2021","unstructured":"Su, Y., Xie, K., Wang, H., et al.: Airline disruption management: a review of models and solution methods[J]. Engineering 7(4), 435\u2013447 (2021)","journal-title":"Engineering"},{"issue":"2","key":"1886_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s42524-020-0126-0","volume":"8","author":"L Tang","year":"2021","unstructured":"Tang, L., Meng, Y.: Data analytics and optimization for smart industry[J]. Front. Eng. Manage. 8(2), 157\u2013171 (2021)","journal-title":"Front. Eng. Manage."},{"key":"1886_CR27","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.dam.2018.03.019","volume":"261","author":"S Thevenin","year":"2019","unstructured":"Thevenin, S., Zufferey, N.: Learning variable neighborhood search for a scheduling problem with time windows and rejections[J]. Discr. Appl. Math. 261, 344\u2013353 (2019)","journal-title":"Discr. Appl. Math."},{"key":"1886_CR28","first-page":"871","volume":"5","author":"Q Wang","year":"2019","unstructured":"Wang, Q., Liu, C., Zheng, L.: A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource[J]. Eng. Optim. 5, 871 (2019)","journal-title":"Eng. Optim."},{"issue":"1","key":"1886_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1108\/eb005544","volume":"9","author":"J We","year":"1980","unstructured":"We, J.: On certain models of resource allocation problems[J]. Kybernetes 9(1), 61\u201366 (1980)","journal-title":"Kybernetes"},{"issue":"4","key":"1886_CR30","doi-asserted-by":"publisher","first-page":"420","DOI":"10.15302\/J-FEM-2018050","volume":"5","author":"S Yang","year":"2018","unstructured":"Yang, S., Wang, J., Shi, L., et al.: Engineering management for high-end equipment intelligent manufacturing[J]. Front. Eng. Manage. 5(4), 420\u2013450 (2018)","journal-title":"Front. Eng. Manage."},{"issue":"8","key":"1886_CR31","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.3390\/math8081355","volume":"8","author":"H Yu","year":"2020","unstructured":"Yu, H., Gao, Y., Wang, L., et al.: A hybrid particle swarm optimization algorithm enhanced with nonlinear inertial weight and Gaussian mutation for job shop scheduling Problems[J]. Mathematics 8(8), 1355 (2020)","journal-title":"Mathematics"},{"issue":"8","key":"1886_CR32","doi-asserted-by":"publisher","first-page":"2449","DOI":"10.1080\/00207540802662896","volume":"48","author":"M Zandieh","year":"2010","unstructured":"Zandieh, M., Adibi, M.A.: Dynamic job shop scheduling using variable neighbourhood search[J]. Int. J. Prod. Res. 48(8), 2449\u20132458 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"1886_CR33","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang, J., Sanderson, A.C.: JADE: adaptive differential evolution with optional external archive[J]. IEEE Trans. Evolutionary Comput. 13(5), 945\u2013958 (2009)","journal-title":"IEEE Trans. Evolutionary Comput."},{"issue":"4","key":"1886_CR34","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s11047-018-9722-x","volume":"19","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Tan, Y., Yang, Z.: Joint optimization of the high-end equipment development task process and resource allocation[J]. Nat. Comput. 19(4), 811\u2013823 (2020)","journal-title":"Nat. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01886-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01886-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01886-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:18:22Z","timestamp":1681305502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01886-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1886"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01886-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"30 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}