{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:18:39Z","timestamp":1753273119254,"version":"3.40.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"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":["72401115"],"award-info":[{"award-number":["72401115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10479-025-06485-z","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T07:24:55Z","timestamp":1737444295000},"page":"2307-2347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An exact approach for bi-objective non-identical batch processing machines scheduling"],"prefix":"10.1007","volume":"346","author":[{"given":"Shaoxiang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Naiming","family":"Xie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0737-7882","authenticated-orcid":false,"given":"Qiao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"6485_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.asoc.2015.01.013","volume":"29","author":"M Al-Salamah","year":"2015","unstructured":"Al-Salamah, M. (2015). Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Applied Soft Computing, 29, 379\u2013385. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.013","journal-title":"Applied Soft Computing"},{"key":"6485_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","volume":"78","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo, J. E. C., & Leung, J.Y.-T. (2017). Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Computers & Operations Research, 78, 117\u2013128. https:\/\/doi.org\/10.1016\/j.cor.2016.08.015","journal-title":"Computers & Operations Research"},{"issue":"2","key":"6485_CR3","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ijpe.2006.02.010","volume":"103","author":"P Damodaran","year":"2006","unstructured":"Damodaran, P., Kumar Manjeshwar, P., & Srihari, K. (2006). Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics, 103(2), 882\u2013891. https:\/\/doi.org\/10.1016\/j.ijpe.2006.02.010","journal-title":"International Journal of Production Economics"},{"key":"6485_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104825","volume":"114","author":"M Dell\u2019Amico","year":"2020","unstructured":"Dell\u2019Amico, M., Furini, F., & Iori, M. (2020). A branch-and-price algorithm for the temporal bin packing problem. Computers & Operations Research, 114, 104825. https:\/\/doi.org\/10.1016\/j.cor.2019.104825","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6485_CR5","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1287\/ijoc.1100.0406","volume":"23","author":"S Elhedhli","year":"2011","unstructured":"Elhedhli, S., Li, L., Gzara, M., & Naoum-Sawaya, J. (2011). A branch-and-price algorithm for the bin packing problem with conflicts. INFORMS Journal on Computing, 23(3), 404\u2013415. https:\/\/doi.org\/10.1287\/ijoc.1100.0406","journal-title":"INFORMS Journal on Computing"},{"key":"6485_CR6","doi-asserted-by":"crossref","unstructured":"Gadegaard, S.L., Nielsen, L.R., & Ehrgott, M. (2019). Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets. INFORMS Journal on Computing, 16.","DOI":"10.1287\/ijoc.2018.0846"},{"key":"6485_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.102150","volume":"92","author":"Y Gao","year":"2020","unstructured":"Gao, Y., Schmidt, M., Yang, L., & Gao, Z. (2020). A branch-and-price approach for trip sequence planning of high-speed train units. Omega, 92, 102150. https:\/\/doi.org\/10.1016\/j.omega.2019.102150","journal-title":"Omega"},{"key":"6485_CR8","doi-asserted-by":"publisher","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., & Kan, A.H.G.R. (1979). Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In: Annals of Discrete Mathematics vol. 5, pp. 287\u2013326. Elsevier. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X . https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016750600870356X","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"6485_CR9","doi-asserted-by":"crossref","unstructured":"Hu, Q. (2017). A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. European Journal of Operational Research, 11.","DOI":"10.1016\/j.ejor.2016.12.021"},{"key":"6485_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.cie.2017.09.037","volume":"113","author":"M Hulett","year":"2017","unstructured":"Hulett, M., Damodaran, P., & Amouie, M. (2017). Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Computers & Industrial Engineering, 113, 425\u2013436. https:\/\/doi.org\/10.1016\/j.cie.2017.09.037","journal-title":"Computers & Industrial Engineering"},{"key":"6485_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102673","volume":"112","author":"A Husseinzadeh Kashan","year":"2022","unstructured":"Husseinzadeh Kashan, A., & Ozturk, O. (2022). Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes. Omega, 112, 102673. https:\/\/doi.org\/10.1016\/j.omega.2022.102673","journal-title":"Omega"},{"issue":"2","key":"6485_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura, Y., & Gimple, M. (1986). Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5(2), 61\u201365.","journal-title":"Operations Research Letters"},{"key":"6485_CR13","doi-asserted-by":"crossref","unstructured":"Jia, Z.-H. (2019). Multi-objective energy-aware batch scheduling using ant colony optimization algorithm. Industrial Engineering, 16.","DOI":"10.1016\/j.cie.2019.03.033"},{"issue":"4","key":"6485_CR14","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1080\/0305215X.2019.1613388","volume":"52","author":"Z-H Jia","year":"2020","unstructured":"Jia, Z.-H., Huo, S.-Y., Li, K., & Chen, H.-P. (2020). Integrated scheduling on parallel batch processing machines with non-identical capacities. Engineering Optimization, 52(4), 715\u2013730. https:\/\/doi.org\/10.1080\/0305215X.2019.1613388","journal-title":"Engineering Optimization"},{"key":"6485_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2015.07.021","volume":"169","author":"Z-H Jia","year":"2015","unstructured":"Jia, Z.-H., Li, K., & Leung, J.Y.-T. (2015). Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities. International Journal of Production Economics, 169, 1\u201310. https:\/\/doi.org\/10.1016\/j.ijpe.2015.07.021","journal-title":"International Journal of Production Economics"},{"key":"6485_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105914","volume":"86","author":"Z-H Jia","year":"2020","unstructured":"Jia, Z.-H., Li, Y.-J., Li, K., & Chen, H.-P. (2020). Weak-restriction bi-objective optimization algorithm for scheduling with rejection on non-identical batch processing machines. Applied Soft Computing, 86, 105914. https:\/\/doi.org\/10.1016\/j.asoc.2019.105914","journal-title":"Applied Soft Computing"},{"issue":"2","key":"6485_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3390\/pr7020103","volume":"7","author":"SS Jogwar","year":"2019","unstructured":"Jogwar, S. S., Mete, S., & Mathpati, C. (2019). Scheduling of energy-integrated batch process systems using a pattern-based framework. Processes, 7(2), 103. https:\/\/doi.org\/10.3390\/pr7020103","journal-title":"Processes"},{"issue":"3","key":"6485_CR18","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.ejor.2017.06.021","volume":"263","author":"S Li","year":"2017","unstructured":"Li, S. (2017). Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities. European Journal of Operational Research, 263(3), 815\u2013826. https:\/\/doi.org\/10.1016\/j.ejor.2017.06.021","journal-title":"European Journal of Operational Research"},{"key":"6485_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.omega.2018.09.014","volume":"89","author":"C Li","year":"2019","unstructured":"Li, C., Gong, L., Luo, Z., & Lim, A. (2019). A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing. Omega, 89, 71\u201391. https:\/\/doi.org\/10.1016\/j.omega.2018.09.014","journal-title":"Omega"},{"key":"6485_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.11.004","volume":"90","author":"M Liu","year":"2020","unstructured":"Liu, M., Yang, X., Chu, F., Zhang, J., & Chu, C. (2020). Energy-oriented bi-objective optimization for the tempered glass scheduling. Omega, 90, 101995. https:\/\/doi.org\/10.1016\/j.omega.2018.11.004","journal-title":"Omega"},{"key":"6485_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102376","volume":"102","author":"X Li","year":"2021","unstructured":"Li, X., Wei, K., Guo, Z., Wang, W., & Aneja, Y. P. (2021). An exact approach for the service network design problem with heterogeneous resource constraints. Omega, 102, 102376. https:\/\/doi.org\/10.1016\/j.omega.2020.102376","journal-title":"Omega"},{"issue":"2","key":"6485_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S Melouk","year":"2004","unstructured":"Melouk, S., Damodaran, P., & Chang, P.-Y. (2004). Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87(2), 141\u2013147. https:\/\/doi.org\/10.1016\/S0925-5273(03)00092-6","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"6485_CR23","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","volume":"285","author":"I Muter","year":"2020","unstructured":"Muter, I. (2020). Exact algorithms to minimize makespan on single and parallel batch processing machines. European Journal of Operational Research, 285(2), 470\u2013483. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.065","journal-title":"European Journal of Operational Research"},{"key":"6485_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106573","volume":"146","author":"TH Nogueira","year":"2020","unstructured":"Nogueira, T. H., Bettoni, A. B., Mendes, G. T. D. O., Santos, A. G., & Ravetti, M. G. (2020). Problem on the integration between production and delivery with parallel batching machines of generic job sizes and processing times. Computers & Industrial Engineering, 146, 106573. https:\/\/doi.org\/10.1016\/j.cie.2020.106573","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"6485_CR25","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1287\/ijoc.2018.0856","volume":"31","author":"SN Parragh","year":"2019","unstructured":"Parragh, S. N., & Tricoire, F. (2019). Branch-and-bound for bi-objective integer programming. INFORMS Journal on Computing, 31(4), 805\u2013822. https:\/\/doi.org\/10.1287\/ijoc.2018.0856","journal-title":"INFORMS Journal on Computing"},{"key":"6485_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","volume":"82","author":"J Pei","year":"2019","unstructured":"Pei, J., Liu, X., Fan, W., Pardalos, P. M., & Lu, S. (2019). A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega, 82, 55\u201369. https:\/\/doi.org\/10.1016\/j.omega.2017.12.003","journal-title":"Omega"},{"key":"6485_CR27","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.omega.2016.06.001","volume":"68","author":"Y Qiu","year":"2017","unstructured":"Qiu, Y., Qiao, J., & Pardalos, P. M. (2017). A branch-and-price algorithm for production routing problems with carbon cap-and-trade. Omega, 68, 49\u201361. https:\/\/doi.org\/10.1016\/j.omega.2016.06.001","journal-title":"Omega"},{"issue":"10","key":"6485_CR28","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1016\/j.cor.2009.12.007","volume":"37","author":"N Rafiee Parsa","year":"2010","unstructured":"Rafiee Parsa, N., Karimi, B., & Husseinzadeh Kashan, A. (2010). A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Computers & Operations Research, 37(10), 1720\u20131730. https:\/\/doi.org\/10.1016\/j.cor.2009.12.007","journal-title":"Computers & Operations Research"},{"key":"6485_CR29","unstructured":"Ryan, D.M., & Foster, B.A. (1981). An integer programming approach to scheduling. Computer scheduling of public transport urban passenger vehicle and crew scheduling, 269\u2013280."},{"key":"6485_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cie.2016.09.018","volume":"101","author":"N Suhaimi","year":"2016","unstructured":"Suhaimi, N., Nguyen, C., & Damodaran, P. (2016). Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Computers & Industrial Engineering, 101, 295\u2013302. https:\/\/doi.org\/10.1016\/j.cie.2016.09.018","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"6485_CR31","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12293-019-00296-z","volume":"11","author":"M Tan","year":"2019","unstructured":"Tan, M., Yang, H.-L., & Su, Y.-X. (2019). Genetic algorithms with greedy strategy for green batch scheduling on non-identical parallel machines. Memetic Computing, 11(4), 439\u2013452. https:\/\/doi.org\/10.1007\/s12293-019-00296-z","journal-title":"Memetic Computing"},{"issue":"2","key":"6485_CR32","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ejor.2023.07.012","volume":"312","author":"Z Tian","year":"2024","unstructured":"Tian, Z., & Zheng, L. (2024). Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches. European Journal of Operational Research, 312(2), 512\u2013524. https:\/\/doi.org\/10.1016\/j.ejor.2023.07.012","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"6485_CR33","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615\u20131635. https:\/\/doi.org\/10.1080\/00207549408957026","journal-title":"International Journal of Production Research"},{"key":"6485_CR34","doi-asserted-by":"publisher","unstructured":"Wang, J.-Q., & Leung, J.Y.-T.: Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan.pdf. International Journal of Production Economics, 156, 325\u2013331 (2014) doi: https:\/\/doi.org\/10.1016\/j.ijpe.2014.06.019","DOI":"10.1016\/j.ijpe.2014.06.019"},{"key":"6485_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114145","volume":"167","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Jia, Z.-H., & Li, K. (2021). A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines. Expert Systems with Applications, 167, 114145. https:\/\/doi.org\/10.1016\/j.eswa.2020.114145","journal-title":"Expert Systems with Applications"},{"key":"6485_CR36","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1016\/j.jclepro.2016.07.206","volume":"137","author":"S Wang","year":"2016","unstructured":"Wang, S., Liu, M., Chu, F., & Chu, C. (2016). Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration. Journal of Cleaner Production, 137, 1205\u20131215. https:\/\/doi.org\/10.1016\/j.jclepro.2016.07.206","journal-title":"Journal of Cleaner Production"},{"issue":"1","key":"6485_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cirp.2016.04.115","volume":"65","author":"J Wang","year":"2016","unstructured":"Wang, J., Qiao, F., Zhao, F., & Sutherland, J. W. (2016). Batch scheduling for minimal energy consumption and tardiness under uncertainties: A heat treatment application. CIRP Annals, 65(1), 17\u201320. https:\/\/doi.org\/10.1016\/j.cirp.2016.04.115","journal-title":"CIRP Annals"},{"key":"6485_CR38","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2018","unstructured":"Wang, D., Yin, Y., & Cheng, T. C. E. (2018). Parallel-machine rescheduling with job unavailability and rejection. Omega, 81, 246\u2013260. https:\/\/doi.org\/10.1016\/j.omega.2018.04.008","journal-title":"Omega"},{"key":"6485_CR39","doi-asserted-by":"crossref","unstructured":"Wei, L. (2020). A branch-and-price algorithm for the two-dimensional vector packing problem. European Journal of Operational Research, 11.","DOI":"10.1016\/j.ejor.2019.08.024"},{"issue":"2","key":"6485_CR40","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.2018.0867","volume":"32","author":"L Wei","year":"2020","unstructured":"Wei, L., Luo, Z., Baldacci, R., & Lim, A. (2020). A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS Journal on Computing, 32(2), 428\u2013443. https:\/\/doi.org\/10.1287\/ijoc.2018.0867","journal-title":"INFORMS Journal on Computing"},{"key":"6485_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106599","volume":"146","author":"N Xie","year":"2020","unstructured":"Xie, N., Zheng, S., & Wu, Q. (2020). Two-dimensional packing algorithm for autoclave molding scheduling of aeronautical composite materials production. Computers & Industrial Engineering, 146, 106599. https:\/\/doi.org\/10.1016\/j.cie.2020.106599","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"6485_CR42","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Y Yin","year":"2013","unstructured":"Yin, Y., Cheng, T. C. E., Hsu, C.-J., & Wu, C.-C. (2013). Single-machine batch delivery scheduling with an assignable common due window. Omega, 41(2), 216\u2013225. https:\/\/doi.org\/10.1016\/j.omega.2012.06.002","journal-title":"Omega"},{"key":"6485_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104889","volume":"117","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Jia, Z.-H., & Li, K. (2020). Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines. Computers & Operations Research, 117, 104889. https:\/\/doi.org\/10.1016\/j.cor.2020.104889","journal-title":"Computers & Operations Research"},{"key":"6485_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105381","volume":"133","author":"S Zheng","year":"2021","unstructured":"Zheng, S., Xie, N., & Wu, Q. (2021). Single batch machine scheduling with dual setup times for autoclave molding manufacturing. Computers & Operations Research, 133, 105381. https:\/\/doi.org\/10.1016\/j.cor.2021.105381","journal-title":"Computers & Operations Research"},{"key":"6485_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106859","volume":"173","author":"S Zheng","year":"2025","unstructured":"Zheng, S., Xie, N., Wu, Q., & Liu, C. (2025). Novel mathematical formulations for parallel-batching processing machine scheduling problems. Computers & Operations Research, 173, 106859. https:\/\/doi.org\/10.1016\/j.cor.2024.106859","journal-title":"Computers & Operations Research"},{"key":"6485_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2020.118420","volume":"209","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Jin, M., & Du, N. (2020). Energy-efficient scheduling of a single batch processing machine with dynamic job arrival times. Energy, 209, 118420. https:\/\/doi.org\/10.1016\/j.energy.2020.118420","journal-title":"Energy"},{"key":"6485_CR47","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cor.2018.04.009","volume":"96","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Li, X., Du, N., Pang, Y., & Chen, H. (2018). A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Computers & Operations Research, 96, 55\u201368. https:\/\/doi.org\/10.1016\/j.cor.2018.04.009","journal-title":"Computers & Operations Research"},{"key":"6485_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2016.05.014","volume":"179","author":"S Zhou","year":"2016","unstructured":"Zhou, S., Liu, M., Chen, H., & Li, X. (2016). An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes. International Journal of Production Economics, 179, 1\u201311. https:\/\/doi.org\/10.1016\/j.ijpe.2016.05.014","journal-title":"International Journal of Production Economics"},{"key":"6485_CR49","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.amc.2018.04.024","volume":"334","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Xie, J., Du, N., & Pang, Y. (2018). A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Applied Mathematics and Computation, 334, 254\u2013268. https:\/\/doi.org\/10.1016\/j.amc.2018.04.024","journal-title":"Applied Mathematics and Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06485-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06485-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06485-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T20:01:44Z","timestamp":1743192104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06485-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["6485"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06485-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"25 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no commercial or associative interests that constitute a Conflict of interest with regard to the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}