{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T18:56:25Z","timestamp":1771268185875,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11424-024-3284-z","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:03:18Z","timestamp":1725015798000},"page":"2054-2070","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Resource Allocation to Minimize the Makespan with Multi-Resource Operations"],"prefix":"10.1007","volume":"37","author":[{"given":"Wuyan","family":"Weng","sequence":"first","affiliation":[]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"issue":"2","key":"3284_CR1","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s11424-015-3252-8","volume":"29","author":"S Li","year":"2016","unstructured":"Li S and Zhang Y, On-line scheduling on parallel machines to minimize the makespan, Journal of Systems Science & Complexity, 2016, 29(2): 472\u2013477.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"8","key":"3284_CR2","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/09511920902810938","volume":"22","author":"C Desprez","year":"2009","unstructured":"Desprez C, Chu F, and Chu C, Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm, International Journal of Computer Integrated Manufacturing, 2009, 22(8): 745\u2013757.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"7","key":"3284_CR3","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0305-0548(99)00083-0","volume":"28","author":"J N D Gupta","year":"2001","unstructured":"Gupta J N D and Ho J C, Minimizing makespan subject to minimum flowtime on two identical parallel machines, Computers & Operations Research, 2001, 28(7): 705\u2013717.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3284_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.ejor.2003.08.034","volume":"160","author":"C J Liao","year":"2005","unstructured":"Liao C J, Shyur D L, and Lin C H, Makespan minimization for two parallel machines with an availability constraint, European Journal of Operational Research, 2005, 160(2): 445\u2013456.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3284_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2016.01.021","volume":"72","author":"J He","year":"2016","unstructured":"He J, Li Q, and Xu D, Scheduling two parallel machines with machine-dependent availabilities, Computers & Operations Research, 2016, 72(1): 31\u201342.","journal-title":"Computers & Operations Research"},{"key":"3284_CR6","doi-asserted-by":"publisher","first-page":"104918","DOI":"10.1016\/j.cor.2020.104918","volume":"118","author":"S Wang","year":"2020","unstructured":"Wang S, Wu R, Chu F, et al., Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job, Computers & Operations Research, 2020, 118: 104918.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3284_CR7","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1007\/s11424-019-7427-6","volume":"32","author":"S Cai","year":"2019","unstructured":"Cai S and Liu K, Heuristics for online scheduling on identical parallel machines with two GoS levels, Journal of Systems Science & Complexity, 2019, 32(4): 1180\u20131193.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"6","key":"3284_CR8","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1007\/s11424-016-5001-z","volume":"29","author":"X Lu","year":"2016","unstructured":"Lu X and Liu Z, An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies, Journal of Systems Science & Complexity, 2016, 29(6): 1650\u20131657.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"1","key":"3284_CR9","first-page":"1","volume":"82","author":"K Li","year":"2019","unstructured":"Li K, Chen J, Fu H, et al., Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint, Applied Soft Computing, 2019, 82(1): 1\u201316.","journal-title":"Applied Soft Computing"},{"key":"3284_CR10","doi-asserted-by":"publisher","first-page":"105990","DOI":"10.1016\/j.cor.2022.105990","volume":"148","author":"S Wang","year":"2022","unstructured":"Wang S, Wu R, Chu F, et al., Unrelated parallel machine scheduling problem with special controllable processing times and setups, Computers & Operations Research, 2022, 148: 105990.","journal-title":"Computers & Operations Research"},{"issue":"19","key":"3284_CR11","doi-asserted-by":"publisher","first-page":"5841","DOI":"10.1080\/00207543.2014.920966","volume":"52","author":"D Yilmaz Eroglu","year":"2014","unstructured":"Yilmaz Eroglu D, Ozmutlu H C, and Ozmutlu S, Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times, International Journal of Production Research, 2014, 52(19): 5841\u20135856.","journal-title":"International Journal of Production Research"},{"key":"3284_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cor.2014.08.002","volume":"53","author":"V Sels","year":"2015","unstructured":"Sels V, Coelho J, Dias A M, et al., Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, Computers & Operations Research, 2015, 53: 107\u2013117.","journal-title":"Computers & Operations Research"},{"key":"3284_CR13","doi-asserted-by":"publisher","first-page":"105999","DOI":"10.1016\/j.cor.2022.105999","volume":"149","author":"S Maecker","year":"2023","unstructured":"Maecker S, Shen L, and Monch L, Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, Computers & Operations Research, 2023, 149: 105999.","journal-title":"Computers & Operations Research"},{"issue":"10","key":"3284_CR14","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, and Ciaschetti G, A genetic algorithm for the flexible job-shop scheduling problem, Computers & Operations Research, 2008, 35(10): 3202\u20133212.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3284_CR15","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, and Shi Y, An effective genetic algorithm for the flexible job-shop scheduling problem, Expert Systems with Applications, 2011, 38(4): 3563\u20133573.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"3284_CR16","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 and Pezzella F, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, European Journal of Operational Research, 2010, 200(2): 395\u2013408.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3284_CR17","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","volume":"37","author":"M Yazdani","year":"2010","unstructured":"Yazdani M, Amiri M, and Zandieh M, Flexible job-shop scheduling with parallel variable neighborhood search algorithm, Expert Systems with Applications, 2010, 37(1): 678\u2013687.","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"3284_CR18","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandieh M, Mahdavi I, et al., An artificial immune algorithm for the flexible job-shop scheduling problem, Future Generation Computer Systems, 2010, 26(4): 533\u2013541.","journal-title":"Future Generation Computer Systems"},{"key":"3284_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2021.104307","volume":"103","author":"M Li","year":"2021","unstructured":"Li M and Lei D, An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times, Engineering Applications of Artificial Intelligence, 2021, 103: 1\u201313.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"10","key":"3284_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math8101661","volume":"8","author":"D Han","year":"2020","unstructured":"Han D, Tang Q, Zhang Z, et al., An improved migrating birds optimization algorithm for a hybrid flow shop scheduling within steel plants, Mathematics, 2020, 8(10): 1\u201328.","journal-title":"Mathematics"},{"key":"3284_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"M K Marichelvam","year":"2014","unstructured":"Marichelvam M K, Prabaharan T, and Yang X S, Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan, Applied Soft Computing, 2014, 19: 93\u2013101.","journal-title":"Applied Soft Computing"},{"key":"3284_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2020.105527","volume":"194","author":"W Shao","year":"2020","unstructured":"Shao W, Shao Z, and Pi D, Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem, Knowledge-Based Systems, 2020, 194: 1\u201317.","journal-title":"Knowledge-Based Systems"},{"key":"3284_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.simpat.2014.10.008","volume":"51","author":"J T Lin","year":"2015","unstructured":"Lin J T and Chen C M, Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing, Simulation Modelling Practice and Theory, 2015, 51: 100\u2013114.","journal-title":"Simulation Modelling Practice and Theory"},{"issue":"1\u20133","key":"3284_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0925-5273(99)00048-1","volume":"64","author":"V Botta-Genoulaz","year":"2000","unstructured":"Botta-Genoulaz V, Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness, International Journal of Production Economics, 2000, 64(1\u20133): 101\u2013111.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"3284_CR25","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin F, Yalaoui F, and Amodeo L, New multi-objective method to solve reentrant hybrid flow shop scheduling problem, European Journal of Operational Research, 2010, 203(1): 22\u201331.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3284_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1504\/EJIE.2010.033331","volume":"4","author":"A Manaa","year":"2010","unstructured":"Manaa A and Chu C, Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors, European Journal of Industrial Engineering, 2010, 4(3): 265\u2013279.","journal-title":"European Journal of Industrial Engineering"},{"issue":"2","key":"3284_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Roux W, and Lasserre J B, Multi-resource shop scheduling with resource flexibility, European Journal of Operational Research, 1998, 107(2): 289\u2013305.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3284_CR28","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/TASE.2010.2052356","volume":"8","author":"Y Mati","year":"2010","unstructured":"Mati Y and Xie X, Multiresource shop scheduling with resource flexibility and blocking, IEEE Transactions on Automation Science and Engineering, 2010, 8(1): 175\u2013189.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"2","key":"3284_CR29","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/msom.1120.0415","volume":"15","author":"W T Huh","year":"2013","unstructured":"Huh W T, Liu N, and Truong V A, Multiresource allocation scheduling in dynamic environments, Manufacturing & Service Operations Management, 2013, 15(2): 280\u2013291.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"2","key":"3284_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C Artigues","year":"2003","unstructured":"Artigues C, Michelon P, and Reusser S, Insertion techniques for static and dynamic resource-constrained project scheduling, European Journal of Operational Research, 2003, 149(2): 249\u2013267.","journal-title":"European Journal of Operational Research"},{"key":"3284_CR31","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.ins.2016.08.046","volume":"372","author":"L Gao","year":"2016","unstructured":"Gao L and Pan Q K, A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem, Information Sciences, 2016, 372: 655\u2013676.","journal-title":"Information Sciences"},{"issue":"1","key":"3284_CR32","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J BnnoBRs","year":"1962","unstructured":"BnnoBRs J, Partitioning procedures for solving mixed-variables programming problems, Numer. Math, 1962, 4(1): 238\u2013252.","journal-title":"Numer. Math"},{"key":"3284_CR33","first-page":"1","volume":"123","author":"A Hamzaday","year":"2020","unstructured":"Hamzaday A, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Computers & Operations Research, 2020, 123: 1\u201315.","journal-title":"Computers & Operations Research"},{"key":"3284_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2019.102117","volume":"94","author":"X Wu","year":"2020","unstructured":"Wu X and Che A, Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search, Omega, 2020, 94: 1\u201316.","journal-title":"Omega"},{"key":"3284_CR35","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.cie.2019.02.015","volume":"130","author":"L Liu","year":"2019","unstructured":"Liu L, Outsourcing and rescheduling for a two-machine flow shop with the disruption of new arriving jobs: A hybrid variable neighborhood search algorithm, Computers & Industrial Engineering, 2019, 130: 198\u2013221.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3284-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-024-3284-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3284-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:21:26Z","timestamp":1725016886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-024-3284-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["3284"],"URL":"https:\/\/doi.org\/10.1007\/s11424-024-3284-z","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,30]]},"assertion":[{"value":"25 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}