{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T19:16:20Z","timestamp":1778526980509,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"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":["12171074"],"award-info":[{"award-number":["12171074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12190-024-02023-5","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T17:02:33Z","timestamp":1710867753000},"page":"1965-1994","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations"],"prefix":"10.1007","volume":"70","author":[{"given":"Jin","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guisong","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"issue":"11","key":"2023_CR1","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1057\/palgrave.jors.2601856","volume":"56","author":"J-B Wang","year":"2005","unstructured":"Wang, J.-B., Xia, Z.-Q.: Flow shop scheduling with a learning effect. J. Oper. Res. Soc. 56(11), 1325\u20131330 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"2023_CR2","doi-asserted-by":"crossref","unstructured":"Wang, J.-B., Wang, L,-Y., Wang, D., Wang, X.-Y., Gao, W.-J., Yin, N.: Single machine scheduling problems with position-dependent processing times. J. Appl. Math. Comput. 30, 293\u2013304 (2009)","DOI":"10.1007\/s12190-008-0173-x"},{"issue":"4","key":"2023_CR3","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., Said, L.B.: Scheduling problems under learning effects: classification and cartography. Int. J. Prod. Res. 56(4), 1642\u20131661 (2018)","journal-title":"Int. J. Prod. Res."},{"key":"2023_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s12190-019-01255-0","volume":"61","author":"X-X Liang","year":"2019","unstructured":"Liang, X.-X., Zhang, B., Wang, J.-B., Yin, N., Huang, X.: Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects. J. Appl. Math. Comput. 61, 373\u2013388 (2019)","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"2023_CR5","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1111\/itor.12323","volume":"26","author":"J-B Wang","year":"2019","unstructured":"Wang, J.-B., Liu, F., Wang, J.-J.: Research on $$m$$-machine flow shop scheduling with truncated learning effects. Int. Trans. Oper. Res. 26(3), 1135\u20131151 (2019)","journal-title":"Int. Trans. Oper. Res."},{"issue":"14","key":"2023_CR6","doi-asserted-by":"publisher","first-page":"2454","DOI":"10.3390\/math10142454","volume":"10","author":"J Qian","year":"2022","unstructured":"Qian, J., Zhan, Y.: Single-machine group scheduling model with position-dependent and job-dependent DeJong\u2019s learning effect. Mathematics 10(14), 2454 (2022)","journal-title":"Mathematics"},{"key":"2023_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109750","volume":"186","author":"J Qian","year":"2023","unstructured":"Qian, J.: Note on single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 186, 109750 (2023)","journal-title":"Comput. Ind. Eng."},{"key":"2023_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s40314-022-02133-5","volume":"41","author":"J-B Wang","year":"2022","unstructured":"Wang, J.-B., Zhang, L.-H., Lv, Z.-G., Lv, D.-Y., Geng, X.-N., Sun, X.: Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects. Comput. Appl. Math. 41, 417 (2022)","journal-title":"Comput. Appl. Math."},{"key":"2023_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054122460030","author":"J Gao","year":"2022","unstructured":"Gao, J., Zou, J., Zhang, Y.: Single-machine scheduling with a deteriorating maintenance activity and DeJong\u2019s learning effect. Int. J. Found. Comput. Sci. (2022). https:\/\/doi.org\/10.1142\/S0129054122460030","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"2023_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114983","volume":"424","author":"A Ferraro","year":"2023","unstructured":"Ferraro, A., Rossit, D.A., Toncovich, A.: Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users. J. Comput. Appl. Math. 424(1), 114983 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2023_CR11","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.066","volume":"187","author":"C Koulamas","year":"2008","unstructured":"Koulamas, C., Kyparisis, G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187, 1045\u20131049 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2023_CR12","doi-asserted-by":"publisher","first-page":"8826345","DOI":"10.1155\/2021\/8826345","volume":"2021","author":"L Sun","year":"2021","unstructured":"Sun, L., Zhang, X.H., Ning, L.: Results of parallel-machine scheduling model with maintenance activity considering time-dependent deterioration, delivery times, and resource allocation. Math. Probl. Eng. 2021, 8826345 (2021)","journal-title":"Math. Probl. Eng."},{"issue":"23","key":"2023_CR13","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.3390\/math9233085","volume":"9","author":"J Qian","year":"2021","unstructured":"Qian, J., Zhan, Y.: The due date assignment scheduling problem with delivery times and truncated sum-of-processing-times-based learning effect. Mathematics 9(23), 3085 (2021)","journal-title":"Mathematics"},{"issue":"2","key":"2023_CR14","doi-asserted-by":"publisher","first-page":"2150013","DOI":"10.1142\/S0217595921500135","volume":"39","author":"J-B Wang","year":"2022","unstructured":"Wang, J.-B., Xue, J., Cui, B., Gao, M.: Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times. Asia. Pac. J. Oper. Res. 39(2), 2150013 (2022)","journal-title":"Asia. Pac. J. Oper. Res."},{"key":"2023_CR15","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian, J., Han, H.: The due date assignment scheduling problem with the deteriorating jobs and delivery time. J. Appl. Math. Comput. 68, 2173\u20132186 (2022)","journal-title":"J. Appl. Math. Comput."},{"key":"2023_CR16","doi-asserted-by":"publisher","first-page":"105936","DOI":"10.1016\/j.cor.2022.105936","volume":"147","author":"C Zhang","year":"2022","unstructured":"Zhang, C., Li, Y., Cao, J., Yang, Z., Coelho, L.C.: Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. Comput. Oper. Res. 147, 105936 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"2023_CR17","doi-asserted-by":"publisher","first-page":"2454","DOI":"10.3390\/math10142454","volume":"10","author":"J Qian","year":"2022","unstructured":"Qian, J., Zhan, Y.: The due window assignment problems with deteriorating job and delivery time. Mathematics 10(10), 2454 (2022)","journal-title":"Mathematics"},{"key":"2023_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-021-04414-4","volume":"309","author":"J Qian","year":"2022","unstructured":"Qian, J., Han, H.Y.: Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann. Oper. Res. 309, 249\u2013258 (2022)","journal-title":"Ann. Oper. Res."},{"key":"2023_CR19","doi-asserted-by":"publisher","first-page":"2645","DOI":"10.1007\/s11590-021-01843-9","volume":"16","author":"J Qian","year":"2022","unstructured":"Qian, J., Chang, G.: A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 16, 2645\u20132648 (2022)","journal-title":"Optim. Lett."},{"issue":"4","key":"2023_CR20","doi-asserted-by":"publisher","first-page":"2824","DOI":"10.3934\/jimo.2022066","volume":"19","author":"S-H Wang","year":"2023","unstructured":"Wang, S.-H., Lv, D.-Y., Wang, J.-B.: Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect. J. Ind. Manag. Optim. 19(4), 2824\u20132837 (2023)","journal-title":"J. Ind. Manag. Optim."},{"issue":"11","key":"2023_CR21","doi-asserted-by":"publisher","first-page":"8429","DOI":"10.3934\/jimo.2023045","volume":"19","author":"N Ren","year":"2023","unstructured":"Ren, N., Lv, D.-Y., Wang, J.-B., Wang, X.-Y.: Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times. J. Ind. Manag. Optim. 19(11), 8429\u20138450 (2023)","journal-title":"J. Ind. Manag. Optim."},{"key":"2023_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s40314-023-02379-7","volume":"42","author":"N Ren","year":"2023","unstructured":"Ren, N., Wang, J.-B., Wang, E.: Research on delivery times scheduling with truncated learning effects. Comput. Appl. Math. 42, 243 (2023)","journal-title":"Comput. Appl. Math."},{"key":"2023_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s10878-023-01025-6","volume":"45","author":"L Pan","year":"2023","unstructured":"Pan, L., Sun, X., Wang, J.-B., Zhang, L.-H., Lv, D.-Y.: Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs. J. Combin. Optim. 45, 100 (2023)","journal-title":"J. Combin. Optim."},{"key":"2023_CR24","doi-asserted-by":"publisher","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. Disc. Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Disc. Appl. Math."},{"key":"2023_CR25","doi-asserted-by":"publisher","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."},{"issue":"5","key":"2023_CR26","doi-asserted-by":"publisher","first-page":"1450036","DOI":"10.1142\/S0217595914500365","volume":"31","author":"J-B Wang","year":"2014","unstructured":"Wang, J.-B., Wang, M.-Z.: Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia Pac. J. Oper. Res. 31(5), 1450036 (2014)","journal-title":"Asia Pac. J. Oper. Res."},{"issue":"2","key":"2023_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/0305215X.2018.1454442","volume":"51","author":"J-B Wang","year":"2019","unstructured":"Wang, J.-B., Liang, X.-X.: Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Eng. Optim. 51(2), 231\u2013246 (2019)","journal-title":"Eng. Optim."},{"issue":"6","key":"2023_CR28","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1080\/00207543.2018.1510559","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun, X., 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(6), 1873\u20131897 (2019)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"2023_CR29","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","volume":"51","author":"X-N Geng","year":"2019","unstructured":"Geng, X.-N., Wang, J.-B., Bai, D.: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51(8), 1301\u20131323 (2019)","journal-title":"Eng. Optim."},{"issue":"1","key":"2023_CR30","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/0305215X.2019.1580705","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu, W., Jiang, C.: Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52(1), 74\u201389 (2020)","journal-title":"Eng. Optim."},{"issue":"4","key":"2023_CR31","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/0305215X.2019.1604698","volume":"52","author":"H-B Shi","year":"2020","unstructured":"Shi, H.-B., Wang, J.-B.: Research on common due window assignment flowshop scheduling with learning effect and resource allocation. Eng. Optim. 52(4), 669\u2013686 (2020)","journal-title":"Eng. Optim."},{"key":"2023_CR32","doi-asserted-by":"publisher","first-page":"106126","DOI":"10.1016\/j.cie.2019.106126","volume":"139","author":"L Sun","year":"2020","unstructured":"Sun, L., Yu, A.J., Wu, B.: Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 139, 106126 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"2023_CR33","doi-asserted-by":"publisher","first-page":"2150008","DOI":"10.1142\/S0217595921500081","volume":"38","author":"D-Y Lv","year":"2021","unstructured":"Lv, D.-Y., Wang, J.-B.: Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects. Asia-Pac. J. Oper. Res. 38(6), 2150008 (2021)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"16","key":"2023_CR34","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.3390\/math10162983","volume":"10","author":"J-X Yan","year":"2022","unstructured":"Yan, J.-X., Ren, N., Bei, H.-B., Bao, H., Wang, J.-B.: Scheduling with resource allocation, deteriorating effect and group technology to minimize total completion time. Mathematics 10(16), 2983 (2022)","journal-title":"Mathematics"},{"key":"2023_CR35","doi-asserted-by":"publisher","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":"2023_CR36","doi-asserted-by":"publisher","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-Pac. J. Oper. Res. https:\/\/doi.org\/10.1142\/S0217595923500264","DOI":"10.1142\/S0217595923500264"},{"key":"2023_CR37","doi-asserted-by":"publisher","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":"2023_CR38","doi-asserted-by":"publisher","unstructured":"Shioura, A., Strusevich, V.A., Shakhlevich, N.V.: Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. https:\/\/doi.org\/10.1007\/s10951-023-00782-w","DOI":"10.1007\/s10951-023-00782-w"},{"key":"2023_CR39","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math. 5, 287\u2014326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"2","key":"2023_CR40","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1080\/0305215X.2019.1577411","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang, J.-B., Zhang, B., Li, L., Bai, D., Feng, Y.-B.: Due window assignment scheduling problems with position-dependent weights on a single machine. Eng. Optim. 52(2), 185\u2013193 (2020)","journal-title":"Eng. Optim."},{"issue":"2","key":"2023_CR41","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s10878-020-00676-z","volume":"41","author":"J-B Wang","year":"2021","unstructured":"Wang, J.-B., Cui, B., Ji, P., Liu, W.-W.: Research on scheduling with position-dependent weights and past-sequence-dependent delivery times. J. Combin. Optim. 41(2), 290\u2013303 (2021)","journal-title":"J. Combin. Optim."},{"key":"2023_CR42","doi-asserted-by":"publisher","unstructured":"Wang, J.-B., Bao, H., Wang, C.: Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pac. J. Oper. Res. https:\/\/doi.org\/10.1142\/S0217595923500392","DOI":"10.1142\/S0217595923500392"},{"key":"2023_CR43","doi-asserted-by":"publisher","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."},{"issue":"1","key":"2023_CR44","doi-asserted-by":"publisher","first-page":"1950031","DOI":"10.1142\/S0217595919500313","volume":"37","author":"X Huang","year":"2020","unstructured":"Huang, X., Yin, N., Liu, W.-W., Wang, J.-B.: Common due window assignment scheduling with proportional linear deterioration effects. Asia-Pac. J. Oper. Res. 37(1), 1950031 (2020)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"4","key":"2023_CR45","doi-asserted-by":"publisher","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(4), 1593\u20131614 (2024)","journal-title":"J. Ind. Manag. Optim."},{"key":"2023_CR46","doi-asserted-by":"publisher","unstructured":"Lv, D.-Y., Xue, J., Wang, J.-B.: Minmax common due-window assignment scheduling with deteriorating jobs. J. Oper. Res. Soc. China., https:\/\/doi.org\/10.1007\/s40305-023-00511-2","DOI":"10.1007\/s40305-023-00511-2"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02023-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02023-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02023-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T13:34:18Z","timestamp":1717162458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02023-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2023"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02023-5","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,19]]},"assertion":[{"value":"9 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 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"}}]}}