{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:25:11Z","timestamp":1781821511755,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"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,8]]},"DOI":"10.1007\/s12190-024-02080-w","type":"journal-article","created":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T05:02:49Z","timestamp":1713330169000},"page":"2907-2939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Permutation flow shop scheduling with makespan objective and truncated learning effects"],"prefix":"10.1007","volume":"70","author":[{"given":"Ming-Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li-Han","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,17]]},"reference":[{"issue":"1","key":"2080_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2007.10.003","volume":"192","author":"C-C Wu","year":"2009","unstructured":"Wu, C.-C., Lee, W.-C.: A note on the total completion time problem in a permutation flowshop with a learning effect. Eur. J. Oper. Res. 192(1), 343\u2013347 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"2080_CR2","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/j.cor.2010.11.001","volume":"38","author":"C-C Wu","year":"2011","unstructured":"Wu, C.-C., Hsu, P.-H., Chen, J.-C., Wang, N.-S.: Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Comput. Oper. Res. 38, 1025\u20131034 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"2080_CR3","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.cor.2011.07.022","volume":"39","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Wu, C.-C., Wu, W.-H., Cheng, S.-R.: The single-machine total weighted tardiness scheduling problem with position-based learning effects. Comput. Oper. Res. 39(5), 1109\u20131116 (2012)","journal-title":"Comput. Oper. Res."},{"key":"2080_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2013.07.026","volume":"256","author":"Y Yin","year":"2014","unstructured":"Yin, Y., Wu, W.-H., Wu, W.-H., Wu, C.-C.: A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf. Sci. 256, 91\u2013108 (2014)","journal-title":"Inf. Sci."},{"issue":"4","key":"2080_CR5","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."},{"issue":"9","key":"2080_CR6","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1080\/0305215X.2019.1664498","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang, J.-B., Gao, M., Wang, J.-J., Liu, L., He, H.: Scheduling with a position-weighted learning effect and job release dates. Eng. Optim. 52(9), 1475\u20131493 (2020)","journal-title":"Eng. Optim."},{"key":"2080_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","volume":"41","author":"S Zhao","year":"2022","unstructured":"Zhao, S.: Scheduling jobs with general truncated learning effects including proportional setup times. Comput. Appl. Math. 41, 146 (2022)","journal-title":"Comput. Appl. Math."},{"key":"2080_CR8","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."},{"issue":"4","key":"2080_CR9","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. Indus. Manag. Optim. 19(4), 2824\u20132837 (2023)","journal-title":"J. Indus. Manag. Optim."},{"issue":"14","key":"2080_CR10","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(14), 3179 (2023)","journal-title":"Mathematics"},{"key":"2080_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","volume":"37","author":"SF Rad","year":"2009","unstructured":"Rad, S.F., Ruiz, R., Boroojerdian, N.: New high performing heuristics for minimizing makespan in permutation flowshops. Omega 37, 331\u2013345 (2009)","journal-title":"Omega"},{"issue":"1","key":"2080_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","volume":"40","author":"Q-K Pan","year":"2013","unstructured":"Pan, Q.-K., Ruiz, R.: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40(1), 117\u2013128 (2013)","journal-title":"Comput. Oper. Res."},{"key":"2080_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.cie.2017.08.031","volume":"112","author":"D Bai","year":"2017","unstructured":"Bai, D., Liang, J., Liu, B., Tang, M., Zhang, Z.-H.: Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. Comput. Indus. Eng. 112, 336\u2013347 (2017)","journal-title":"Comput. Indus. Eng."},{"issue":"64","key":"2080_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TEM.2017.2712611","volume":"4","author":"F Liu","year":"2017","unstructured":"Liu, F., Wang, S., Hong, Y., Yue, X.: On the robust and stable flowshop scheduling under stochastic and dynamic disruptions. IEEE Trans. Eng. Manage. 4(64), 539\u2013553 (2017)","journal-title":"IEEE Trans. Eng. Manage."},{"issue":"2","key":"2080_CR15","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2019.09.036","volume":"282","author":"TS Yu","year":"2020","unstructured":"Yu, T.S., Pinedo, M.: Flow shops with reentry: Reversibility properties and makespan optimal schedules. Eur. J. Oper. Res. 282(2), 478\u2013490 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2080_CR16","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D-Y Lv","year":"2021","unstructured":"Lv, D.-Y., Wang, J.-B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 15(6), 2311\u20132319 (2021)","journal-title":"Optim. Lett."},{"key":"2080_CR17","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.: Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann. Oper. Res. 309, 249\u2013258 (2022)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2080_CR18","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.ijpe.2012.08.014","volume":"141","author":"W-C Lee","year":"2013","unstructured":"Lee, W.-C., Chung, Y.-H.: Permutation flowshop scheduling to minimize the total tardiness with learning effects. Int. J. Prod. Econ. 141(1), 327\u2013334 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"2080_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2014.12.006","volume":"58","author":"J-J Wang","year":"2015","unstructured":"Wang, J.-J., Zhang, B.-H.: Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput. Oper. Res. 58, 24\u201331 (2015)","journal-title":"Comput. Oper. Res."},{"key":"2080_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.omega.2017.10.002","volume":"78","author":"D Bai","year":"2018","unstructured":"Bai, D., Tang, M., Zhang, Z.-H., Santibanez-Gonzalez, E.D.R.: Flow shop learning effect scheduling problem with release dates. Omega 78, 21\u201338 (2018)","journal-title":"Omega"},{"key":"2080_CR21","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":"8","key":"2080_CR22","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":"3","key":"2080_CR23","doi-asserted-by":"publisher","first-page":"2050014","DOI":"10.1142\/S0217595920500141","volume":"37","author":"W-W Liu","year":"2020","unstructured":"Liu, W.-W., Jiang, C.: Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights. Asia-Pac. J. Oper. Res. 37(3), 2050014 (2020)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"5","key":"2080_CR24","doi-asserted-by":"publisher","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. Indus. Manag. Optim. 17(5), 2817\u20132835 (2021)","journal-title":"J. Indus. Manag. Optim."},{"issue":"12","key":"2080_CR25","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"X Sun","year":"2021","unstructured":"Sun, X., 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(12), 2674\u20132689 (2021)","journal-title":"J. Oper. Res. Soc."},{"key":"2080_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s10878-021-00752-y","volume":"43","author":"Z Jiang","year":"2022","unstructured":"Jiang, Z., Chen, F., Zhang, X.: Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect. J. Comb. Optim. 43, 116\u2013139 (2022)","journal-title":"J. Comb. Optim."},{"key":"2080_CR27","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":"2080_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.jmsy.2015.02.002","volume":"35","author":"W-H Wu","year":"2015","unstructured":"Wu, W.-H., Wu, W.-H., Chen, J.-C., Lind, W.-C., Wu, J., Wu, C.-C.: A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. J. Manuf. Syst. 35, 223\u2013233 (2015)","journal-title":"J. Manuf. Syst."},{"issue":"3","key":"2080_CR29","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."},{"key":"2080_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108939","volume":"177","author":"D Bai","year":"2023","unstructured":"Bai, D., Liu, T., Zhang, Y., Ren, T., Zhang, Z.-H., Dong, Z.: Scheduling non-permutation flowshop with finite buffers and two competitive agents. Comput. Indus. Eng. 177, 108939 (2023)","journal-title":"Comput. Indus. Eng."},{"issue":"2","key":"2080_CR31","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"2080_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E., Jr., Ham, I.: A heuristic algorithm for the $$m$$-machine, $$n$$-job flow-shop sequencing problem. Omega 11, 91\u201395 (1983)","journal-title":"Omega"},{"issue":"2","key":"2080_CR33","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1002\/hfm.20365","volume":"24","author":"K Lai","year":"2014","unstructured":"Lai, K., Hsu, P.-H., Ting, P.-H., Wu, C.-C.: A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem. Human Factors Ergon. Manuf. Serv. Indus. 24(2), 152\u2013160 (2014)","journal-title":"Human Factors Ergon. Manuf. Serv. Indus."},{"key":"2080_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00511-2","author":"D-Y Lv","year":"2023","unstructured":"Lv, D.-Y., Xue, J., Wang, J.-B.: Minmax common due-window assignment scheduling with deteriorating jobs. J. Oper. Res. Soc. China (2023). https:\/\/doi.org\/10.1007\/s40305-023-00511-2","journal-title":"J. Oper. Res. Soc. China"},{"key":"2080_CR35","doi-asserted-by":"publisher","first-page":"150","DOI":"10.3390\/systems11030150","volume":"11","author":"W Wu","year":"2023","unstructured":"Wu, W., Lv, D.-Y., Wang, J.-B.: Two due-date assignment scheduling with location-dependent weights and a deteriorating maintenance activity. Systems 11, 150 (2023)","journal-title":"Systems"},{"key":"2080_CR36","doi-asserted-by":"publisher","DOI":"10.1142\/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-Pac. J. Oper. Res. (2024). https:\/\/doi.org\/10.1142\/10.1142\/S0217595923500392","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1","key":"2080_CR37","doi-asserted-by":"publisher","first-page":"2240011","DOI":"10.1142\/S0217595922400115","volume":"40","author":"CX Miao","year":"2023","unstructured":"Miao, C.X., Kong, F.Y., Zou, J., Ma, R., Huo, Y.J.: Parallel-machine scheduling with step-deteriorating jobs to minimize the total (weighted) completion time. Asia-Pac. J. Oper. Res. 40(1), 2240011 (2023)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2080_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10951-022-00756-4","volume":"26","author":"X Sun","year":"2023","unstructured":"Sun, X., Liu, T., Geng, X.-N., Hu, Y., Xu, J.-X.: Optimization of scheduling problems with deterioration effects and an optional maintenance activity. J. Sched. 26, 251\u2013266 (2023)","journal-title":"J. Sched."},{"key":"2080_CR39","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500264","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-Pac. J. Oper. Res. (2024). https:\/\/doi.org\/10.1142\/S0217595923500264","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2080_CR40","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. Indus. Manag. Optim. 20, 1593\u20131614 (2024)","journal-title":"J. Indus. Manag. Optim."},{"key":"2080_CR41","doi-asserted-by":"publisher","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":"2080_CR42","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-Pac. J. Oper. Res. (2024). https:\/\/doi.org\/10.1142\/S0217595924500039","journal-title":"Asia-Pac. J. Oper. Res."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02080-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02080-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02080-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T17:15:42Z","timestamp":1721754942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02080-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,17]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2080"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02080-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,17]]},"assertion":[{"value":"22 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 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 there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}