{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T19:15:20Z","timestamp":1778526920625,"version":"3.51.4"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"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. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s12190-024-02216-y","type":"journal-article","created":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T18:02:16Z","timestamp":1723658536000},"page":"6283-6308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments"],"prefix":"10.1007","volume":"70","author":[{"given":"Xuyin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiguo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,14]]},"reference":[{"key":"2216_CR1","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Discret. Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discret. Appl. Math."},{"key":"2216_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.ejor.2017.03.004","volume":"261","author":"L Yedidsiona","year":"2017","unstructured":"Yedidsiona, L., Shabtay, D.: The resource dependent assignment problem with a convex agent cost function. Eur. J. Oper. Res. 261, 486\u2013502 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"2216_CR3","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1080\/00207543.2018.1510559","volume":"57","author":"XY Sun","year":"2019","unstructured":"Sun, X.Y., Geng, X.-N., Wang, J.-B., Liu, F.: Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. Int. J. Prod. Res. 57, 1873\u20131891 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"2216_CR4","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1080\/01605682.2023.2244529","volume":"75","author":"S Kovalev","year":"2023","unstructured":"Kovalev, S., Chalamon, I., B\u00e9cuwe, A.: Single machine scheduling with resource constraints: equivalence to two-machine flow-shop scheduling for regular objectives. J. Oper. Res. Soc. 75, 1343\u20131346 (2023)","journal-title":"J. Oper. Res. Soc."},{"key":"2216_CR5","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.3934\/jimo.2020096","volume":"17","author":"S Zhao","year":"2021","unstructured":"Zhao, S.: Resource allocation flowshop scheduling with learning effect and slack due window assignment. J. Ind. Manag. Optim. 17, 2817\u20132835 (2021)","journal-title":"J. Ind. Manag. Optim."},{"key":"2216_CR6","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1080\/0305215X.2020.1773813","volume":"53","author":"Y-Y Lu","year":"2021","unstructured":"Lu, Y.-Y., Wang, T.-T., Wang, R.-Q., Li, Y.: A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation. Eng. Optim. 53, 1273\u20131281 (2021)","journal-title":"Eng. Optim."},{"key":"2216_CR7","volume":"153","author":"B Mor","year":"2021","unstructured":"Mor, B., Shabtay, D., Yedidsion, L.: Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153, 107024 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR8","doi-asserted-by":"crossref","first-page":"2150041","DOI":"10.1142\/S021759592150041X","volume":"39","author":"Y Tian","year":"2022","unstructured":"Tian, Y.: Single-machine due-window assignment scheduling with resource allocation and generalized earliness\/tardiness penalties. Asia-Pacific J. Oper. Res. 39, 2150041 (2022)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2216_CR9","doi-asserted-by":"crossref","first-page":"3179","DOI":"10.3390\/math11143179","volume":"11","author":"Y-C Wang","year":"2023","unstructured":"Wang, Y.-C., Wang, J.-B.: Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics 11, 3179 (2023)","journal-title":"Mathematics"},{"key":"2216_CR10","doi-asserted-by":"crossref","first-page":"2737","DOI":"10.3390\/math11122737","volume":"11","author":"L-H Zhang","year":"2023","unstructured":"Zhang, L.-H., Lv, D.-Y., Wang, J.-B.: Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs. Mathematics 11, 2737 (2023)","journal-title":"Mathematics"},{"key":"2216_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s40314-024-02753-z","volume":"43","author":"M-H Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Lv, Z.-G., Zhang, L.-H., Wang, J.-B.: A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comput. Appl. Math. 43, 229 (2024)","journal-title":"Comput. Appl. Math."},{"key":"2216_CR12","doi-asserted-by":"crossref","first-page":"2350026","DOI":"10.1142\/S0217595923500264","volume":"41","author":"J-B Wang","year":"2024","unstructured":"Wang, J.-B., Wang, Y.-C., Wan, C., Lv, D.-Y., Zhang, L.: Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pacific J. Oper. Res. 41, 2350026 (2024)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2216_CR13","doi-asserted-by":"crossref","first-page":"1965","DOI":"10.1007\/s12190-024-02023-5","volume":"70","author":"J Qian","year":"2024","unstructured":"Qian, J., Chang, G., Zhang, X.: Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations. J. Appl. Math. Comput. 70, 1965\u20131994 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2216_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3934\/jimo.2023067","volume":"20","author":"XY Sun","year":"2024","unstructured":"Sun, X.Y., Geng, X.-N., Wang, J.Y., Pan, L.: Slack due window assignment scheduling in the single-machine with controllable processing times. J. Ind. Manag. Optim. 20, 15\u201335 (2024)","journal-title":"J. Ind. Manag. Optim."},{"key":"2216_CR15","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2024.2371527","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Sun, X.-Y., Liu, T., Wang, J., Geng, X.-N.: Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects. J. Oper. Res. Soc. (2024). https:\/\/doi.org\/10.1080\/01605682.2024.2371527","journal-title":"J. Oper. Res. Soc."},{"key":"2216_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43, 395\u2013406 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"2216_CR17","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., Baker, K.R.: Scheduling groups of jobs on a single machine. Oper. Res. 43, 692\u2013703 (1995)","journal-title":"Oper. Res."},{"key":"2216_CR18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ijpe.2008.05.004","volume":"115","author":"C-C Wu","year":"2008","unstructured":"Wu, C.-C., Lee, W.-C.: Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int. J. Prod. Econ. 115, 128\u2013133 (2008)","journal-title":"Int. J. Prod. Econ."},{"key":"2216_CR19","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ijpe.2010.12.023","volume":"130","author":"SS Li","year":"2011","unstructured":"Li, S.S., Ng, C.T., Yuan, J.J.: Group scheduling and due date assignment on a single machine. Int. J. Prod. Econ. 130, 230\u2013235 (2011)","journal-title":"Int. J. Prod. Econ."},{"key":"2216_CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cie.2013.11.017","volume":"68","author":"M Ji","year":"2014","unstructured":"Ji, M., Chen, K., Ge, J., Cheng, T.C.E.: Group scheduling and job-dependent due window assignment based on a common flow allowance. Comput. Ind. Eng. 68, 35\u201341 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR21","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.1080\/00207543.2015.1058538","volume":"54","author":"M Ji","year":"2014","unstructured":"Ji, M., Chen, K., Ge, J., Cheng, T.C.E.: Group scheduling with group-dependent multiple due windows assignment. Int. J. Prod. Res. 54, 1244\u20131256 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"2216_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2018.01.002","volume":"117","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Liao, L., Zhang, W., Cheng, T.C.E., Tan, Y., Ji, M.: Single-machine group scheduling with new models of position-dependent processing times. Comput. Ind. Eng. 117, 1\u20135 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR23","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s12190-018-01222-1","volume":"60","author":"X Huang","year":"2019","unstructured":"Huang, X.: Bicriterion scheduling with group technology and deterioration effect. J. Appl. Math. Comput. 60, 455\u2013464 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"2216_CR24","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1080\/0305215X.2018.1500562","volume":"51","author":"F Liu","year":"2019","unstructured":"Liu, F., Yang, J., Lu, Y.-Y.: Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Eng. Optim. 51, 862\u2013874 (2019)","journal-title":"Eng. Optim."},{"key":"2216_CR25","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1111\/itor.12406","volume":"26","author":"N Bajwa","year":"2019","unstructured":"Bajwa, N., Melouk, S., Bryant, A.: A hybrid heuristic approach to minimize number of tardy jobs in group technology systems. Int. Trans. Oper. Res. 26, 1847\u20131867 (2019)","journal-title":"Int. Trans. Oper. Res."},{"key":"2216_CR26","doi-asserted-by":"crossref","first-page":"2860","DOI":"10.1109\/TSMC.2019.2917446","volume":"51","author":"HY Xu","year":"2021","unstructured":"Xu, H.Y., Li, X.P., Ruiz, R., Zhu, H.H.: Group scheduling with nonperiodical maintenance and deteriorating effects. IEEE Trans. Syst. Man Cybernet. Syst. 51, 2860\u20132872 (2021)","journal-title":"IEEE Trans. Syst. Man Cybernet. Syst."},{"key":"2216_CR27","doi-asserted-by":"crossref","first-page":"2340007","DOI":"10.1142\/S0217595923400079","volume":"40","author":"Y Chen","year":"2023","unstructured":"Chen, Y., Xu, Y., Zhang, G., Cheng, Y.: A single machine group scheduling problem with due date assignment and position-dependent costs. Asia-Pacific J. Oper. Res. 40, 2340007 (2023)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2216_CR28","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2023.03.038","volume":"310","author":"X He","year":"2023","unstructured":"He, X., Pan, Q.-K., Gao, L., Neufeld, J.S.: An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem. Eur. J. Oper. Res. 310, 597\u2013610 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"2216_CR29","doi-asserted-by":"crossref","first-page":"19427","DOI":"10.3934\/math.2023991","volume":"8","author":"DY Wang","year":"2023","unstructured":"Wang, D.Y., Ye, C.M.: Single machine and group scheduling with random learning rates. AIMS Math. 8, 19427\u201319441 (2023)","journal-title":"AIMS Math."},{"key":"2216_CR30","doi-asserted-by":"crossref","first-page":"2218","DOI":"10.1016\/j.cor.2010.03.012","volume":"37","author":"D Shabtay","year":"2010","unstructured":"Shabtay, D., Itskovich, Y., Yedidsion, L., Oron, O.: Optimal due date assignment and resource allocation in a group technology scheduling environment. Comput. Oper. Res. 37, 2218\u20132228 (2010)","journal-title":"Comput. Oper. Res."},{"key":"2216_CR31","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.cie.2010.10.012","volume":"60","author":"Z Zhu","year":"2011","unstructured":"Zhu, Z., Sun, L., Chu, F., Liu, M.: Single-machine group scheduling with resource allocation and learning effect. Comput. Ind. Eng. 60, 148\u2013157 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR32","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s11590-012-0577-2","volume":"8","author":"D Wang","year":"2014","unstructured":"Wang, D., Huo, Y., Ji, P.: Single-machine group scheduling with deteriorating jobs and allotted resource. Optim. Lett. 8, 591\u2013605 (2014)","journal-title":"Optim. Lett."},{"key":"2216_CR33","volume":"151","author":"D-Y Lv","year":"2021","unstructured":"Lv, D.-Y., Luo, S.-W., Xue, J., Xu, J.-X., Wang, J.-B.: A note on single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 151, 106941 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR34","doi-asserted-by":"crossref","first-page":"3419","DOI":"10.3934\/jimo.2022091","volume":"19","author":"J-X Yan","year":"2023","unstructured":"Yan, J.-X., Ren, N., Bei, H.-B., Bao, H., Wang, J.-B.: Study on resource allocation scheduling problem with learning factors and group technology. J. Ind. Manag. Optim. 19, 3419\u20133435 (2023)","journal-title":"J. Ind. Manag. Optim."},{"key":"2216_CR35","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.3390\/pr11041271","volume":"11","author":"WG Liu","year":"2023","unstructured":"Liu, W.G., Wang, X.Y.: Group technology scheduling with due-date assignment and controllable processing times. Processes 11, 1271 (2023)","journal-title":"Processes"},{"key":"2216_CR36","doi-asserted-by":"crossref","first-page":"4745","DOI":"10.3390\/math11234745","volume":"11","author":"H He","year":"2023","unstructured":"He, H., Zhao, Y., Ma, X.J., Lv, Z.-G., Wang, J.-B.: Branch-and-bound and heuristic algorithms for group scheduling with due-date assignment and resource allocation. Mathematics 11, 4745 (2023)","journal-title":"Mathematics"},{"key":"2216_CR37","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.3390\/math12071029","volume":"12","author":"M-H Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Lu, Y.-Y., Wang, J.-B.: Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics 12, 1029 (2024)","journal-title":"Mathematics"},{"key":"2216_CR38","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10878-023-00993-z","volume":"45","author":"Y Chen","year":"2023","unstructured":"Chen, Y., Ma, X., Zhang, F., Cheng, Y.: On optimal due date assignment without restriction and resource allocation in group technology scheduling. J. Comb. Optim. 45, 64 (2023)","journal-title":"J. Comb. Optim."},{"key":"2216_CR39","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1007\/s10878-020-00600-5","volume":"44","author":"Y Yang","year":"2022","unstructured":"Yang, Y., Yin, G., Wang, C., Yin, Y.: Due date assignment and two-agent scheduling under multitasking environment. J. Comb. Optim. 44, 2207\u20132223 (2022)","journal-title":"J. Comb. Optim."},{"key":"2216_CR40","volume":"181","author":"X-N Geng","year":"2023","unstructured":"Geng, X.-N., Sun, X.Y., Wang, J.Y., Pan, L.: Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput. Ind. Eng. 181, 109317 (2023)","journal-title":"Comput. Ind. Eng."},{"key":"2216_CR41","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595924500039","author":"D-Y Lv","year":"2024","unstructured":"Lv, D.-Y., Wang, J.-B.: No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia-Pacific J. Oper. Res. (2024). https:\/\/doi.org\/10.1142\/S0217595924500039","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2216_CR42","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500392","author":"J-B Wang","year":"2024","unstructured":"Wang, J.-B., Bao, H., Wang, C.: Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pacific J. Oper. Res. (2024). https:\/\/doi.org\/10.1142\/S0217595923500392","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2216_CR43","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"JM Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31, 311\u2013317 (2003)","journal-title":"Omega"},{"key":"2216_CR44","doi-asserted-by":"crossref","first-page":"2907","DOI":"10.1007\/s12190-024-02080-w","volume":"70","author":"M-H Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Zhang, L.-H., Wang, J.-B.: Permutation flow shop scheduling with makespan objective and truncated learning effects. J. Appl. Math. Comput. 70, 2907\u20132939 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2216_CR45","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1057\/jors.2011.40","volume":"63","author":"J-B Wang","year":"2012","unstructured":"Wang, J.-B., Wang, M.-Z.: Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J. Oper. Res. Soc. 63, 130\u2013137 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"2216_CR46","volume":"2015","author":"X Liu","year":"2015","unstructured":"Liu, X., Li, K., Ren, H.: A hybrid algorithm for the permutation flowshop scheduling problem without intermediate buffers. Discret. Dyn. Nat. Soc. 2015, 548363 (2015)","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"2216_CR47","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"XY Sun","year":"2021","unstructured":"Sun, X.Y., Geng, X.-N., Liu, F.: Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J. Oper. Res. Soc. 72, 2674\u20132689 (2021)","journal-title":"J. Oper. Res. Soc."},{"key":"2216_CR48","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2024.2372633","author":"D-Y Lv","year":"2024","unstructured":"Lv, D.-Y., Wang, J.-B.: Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng. Optim. (2024). https:\/\/doi.org\/10.1080\/0305215X.2024.2372633","journal-title":"Eng. Optim."},{"key":"2216_CR49","first-page":"9260479","volume":"2020","author":"S-S Lin","year":"2020","unstructured":"Lin, S.-S.: Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights. Discret. Dyn. Nat. Soc. 2020, 9260479 (2020)","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"2216_CR50","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.3390\/math11183983","volume":"11","author":"R-R Mao","year":"2023","unstructured":"Mao, R.-R., Wang, Y.-C., Lv, D.-Y., Wang, J.-B., Lu, Y.-Y.: Delivery times scheduling with deterioration effects in due window assignment environments. Mathematics 11, 3983 (2023)","journal-title":"Mathematics"},{"key":"2216_CR51","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s40305-023-00511-2","volume":"12","author":"D-Y Lv","year":"2024","unstructured":"Lv, D.-Y., Xue, J., Wang, J.-B.: Minmax common due-window assignment scheduling with deteriorating jobs. J. Oper. Res. Soc. China 12, 681\u2013693 (2024)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2216_CR52","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.3934\/jimo.2023136","volume":"20","author":"L-H Zhang","year":"2024","unstructured":"Zhang, L.-H., Geng, X.-N., Xue, J., Wang, J.-B.: Single machine slack due window assignment and deteriorating jobs. J. Ind. Manag. Optim. 20, 1593\u20131614 (2024)","journal-title":"J. Ind. Manag. Optim."},{"key":"2216_CR53","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz, S.: Models and algorithms of time-dependent scheduling. Springer, Berlin (2020)"},{"key":"2216_CR54","doi-asserted-by":"crossref","first-page":"610","DOI":"10.3390\/math12040610","volume":"12","author":"Z-G Lv","year":"2024","unstructured":"Lv, Z.-G., Zhang, L.-H., Wang, X.-Y., Wang, J.-B.: Single machine scheduling proportionally deteriorating jobs with ready times subject to the total weighted completion time minimization. Mathematics 12, 610 (2024)","journal-title":"Mathematics"},{"key":"2216_CR55","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1007\/s12190-024-02052-0","volume":"70","author":"R-R Mao","year":"2024","unstructured":"Mao, R.-R., Lv, D.-Y., Ren, N., Wang, J.-B.: Supply chain scheduling with deteriorating jobs and delivery times. J. Appl. Math. Comput. 70, 2285\u20132312 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2216_CR56","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2024.2366537","author":"R Ma","year":"2024","unstructured":"Ma, R., Meng, L.M., Zhang, Y.Z.: Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process. J. Oper. Res. Soc. China (2024). https:\/\/doi.org\/10.1080\/01605682.2024.2366537","journal-title":"J. Oper. Res. Soc. China"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02216-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02216-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02216-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T14:05:21Z","timestamp":1732889121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02216-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,14]]},"references-count":56,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2216"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02216-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,14]]},"assertion":[{"value":"9 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":4,"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 they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}