{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:02:40Z","timestamp":1776128560298,"version":"3.50.1"},"reference-count":63,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:00:00Z","timestamp":1740009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"fundamental research funds for the universities of liaoning province","award":["JYTMS20230278"],"award-info":[{"award-number":["JYTMS20230278"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Single-machine group scheduling with general logarithmic deterioration is investigated, where the actual job processing (resp. group setup) time is a non-decreasing function of the sum of the logarithmic job processing (resp. group setup) times of the jobs (resp. groups) already processed. Under some optimal properties, it is shown that the maximal completion time (i.e., makespan) cost is solved in polynomial time and the optimal algorithm is presented. In addition, an extension of the general weighted deterioration model is given.<\/jats:p>","DOI":"10.3390\/axioms14030153","type":"journal-article","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T11:03:37Z","timestamp":1740049417000},"page":"153","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Research on Group Scheduling with General Logarithmic Deterioration Subject to Maximal Completion Time Cost"],"prefix":"10.3390","volume":"14","author":[{"given":"Jin-Da","family":"Miao","sequence":"first","affiliation":[{"name":"School of Economics and Management, Shenyang Aerospace University, Shenyang 110136, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Mechatronics Engineering, Shenyang Aerospace University, Shenyang 110136, China"},{"name":"Key Laboratory of Rapid Development & Manufacturing Technology for Aircraft (Shenyang Aerospace University), Ministry of Education, Shenyang 110136, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai-Min","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer, Shantou University, Shantou 515063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Shenyang Aerospace University, Shenyang 110136, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2099","DOI":"10.1016\/j.cor.2004.11.024","article-title":"Single-machine group scheduling with a time-dependent learning effect","volume":"33","author":"Kuo","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2159","DOI":"10.1016\/j.apm.2008.05.020","article-title":"A note on single-machine group scheduling problems with position-based learning effect","volume":"33","author":"Lee","year":"2009","journal-title":"Appl. Math. Model."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10479-012-1111-8","article-title":"Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect","volume":"196","author":"Kuo","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1080\/00207721.2013.822126","article-title":"One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations","volume":"46","author":"He","year":"2015","journal-title":"Int. J. Syst. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2018.01.002","article-title":"Single-machine group scheduling with new models of position-dependent processing times","volume":"117","author":"Zhang","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1080\/0305215X.2018.1500562","article-title":"Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs","volume":"51","author":"Liu","year":"2019","journal-title":"Eng. Optim."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s12190-018-01222-1","article-title":"Bicriterion scheduling with group technology and deterioration effect","volume":"60","author":"Huang","year":"2019","journal-title":"J. Appl. Math. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6685149","DOI":"10.1155\/2021\/6685149","article-title":"Group scheduling with learning effect and random processing time","volume":"2021","author":"Wang","year":"2021","journal-title":"J. Math."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Qian, J., and Zhan, Y. (2022). Single-machine group scheduling model with position-dependent and job-dependent DeJong\u2019s learning effect. Mathematics, 10.","DOI":"10.3390\/math10142454"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Liu, W., and Wang, X. (2023). Group technology scheduling with due-date assignment and controllable processing times. Processes, 11.","DOI":"10.3390\/pr11041271"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10878-023-00993-z","article-title":"On optimal due date assignment without restriction and resource allocation in group technology scheduling","volume":"45","author":"Chen","year":"2023","journal-title":"J. Comb. Optim."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, M.-H., Lv, D.-Y., Lu, Y.-Y., and Wang, J.-B. (2024). Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics, 12.","DOI":"10.3390\/math12071029"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Wang, X., and Liu, W. (2024). Optimal different due-dates assignment scheduling with group technology and resource allocation. Mathematics, 12.","DOI":"10.3390\/math12030436"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6283","DOI":"10.1007\/s12190-024-02216-y","article-title":"Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments","volume":"70","author":"Wang","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/s40314-024-02881-6","article-title":"Single-machine group scheduling with general linear deterioration and truncated learning effects","volume":"43","author":"Yin","year":"2024","journal-title":"Comput. Appl. Math."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lv, D.-Y., and Wang, J.-B. (2024). Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion. J. Oper. Res. Soc.","DOI":"10.1080\/01605682.2024.2430351"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Gawiejnowicz, S. (2020). Models and Algorithms of Time-Dependent Scheduling, Springer.","DOI":"10.1007\/978-3-662-59362-2"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Strusevich, V.A., and Rustogi, K. (2017). Scheduling with Times-Changing Effects and Rate-Modifying Activities, Springer.","DOI":"10.1007\/978-3-319-39574-6"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10951-022-00766-2","article-title":"Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times","volume":"27","author":"Shabtay","year":"2024","journal-title":"J. Sched."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sun, Z.-W., Lv, D.-Y., Wei, C.-M., and Wang, J.-B. (2025). Flow shop scheduling with shortening jobs for makespan minimization. Mathematics, 13.","DOI":"10.3390\/math13030363"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2350026","DOI":"10.1142\/S0217595923500264","article-title":"Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs","volume":"41","author":"Wang","year":"2024","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.3934\/jimo.2023136","article-title":"Single machine slack due window assignment and deteriorating jobs","volume":"20","author":"Zhang","year":"2024","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Lu, Y.-Y., Zhang, S., and Tao, J.-Y. (2024). Earliness-tardiness scheduling with delivery times and deteriorating jobs. Asia-Pac. J. Oper. Res.","DOI":"10.1142\/S021759592450009X"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Qiu, X.-Y., and Wang, J.-B. (2024). Single-machine scheduling with mixed due-windows and deterioration effects. J. Appl. Math. Comput.","DOI":"10.1007\/s12190-024-02306-x"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","article-title":"Single-machine and two-machine flowshop scheduling with general learning functions","volume":"178","author":"Koulamas","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","article-title":"Scheduling jobs with general truncated learning effects including proportional setup times","volume":"41","author":"Zhao","year":"2022","journal-title":"Comput. Appl. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","article-title":"Scheduling problems under learning effects: Classification and cartography","volume":"56","author":"Azzouz","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1057\/jors.2016.40","article-title":"Single-machine scheduling with times-based and job-dependent learning effect","volume":"68","author":"Jiang","year":"2017","journal-title":"J. Oper. Res. Soc."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Liu, Z., and Wang, J.-B. (2024). Single-machine scheduling with simultaneous learning effects and delivery times. Mathematics, 12.","DOI":"10.3390\/math12162522"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Gerstl, E., and Mosheiov, G. (2024). Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. Optim. Lett.","DOI":"10.1007\/s11590-024-02138-5"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Cohen, E., and Shapira, D. (2024). Minimising the makespan on parallel identical machines with log-linear position-dependent processing times. J. Oper. Res. Soc.","DOI":"10.1080\/01605682.2024.2382150"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/comjnl\/bxae095","article-title":"Research on convex resource allocation scheduling with exponential time-dependent learning effects","volume":"68","author":"Zhang","year":"2025","journal-title":"Comput. J."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2012.04.037","article-title":"Simple matching vs linear assignment in scheduling models with positional effects: A critical review","volume":"222","author":"Vitaly","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1080\/01605682.2022.2064781","article-title":"Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times","volume":"74","year":"2023","journal-title":"J. Oper. Res. Soc."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1111\/itor.13518","article-title":"Sequencing situations with position-dependent effects under cooperation","volume":"32","author":"Mosquera","year":"2025","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Hu, C.M., Zheng, R., Lu, S.J., and Liu, X.B. (2024). Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities. J. Glob. Optim.","DOI":"10.1007\/s10898-024-01411-2"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00170-009-2224-3","article-title":"Two-agent group scheduling with deteriorating jobs on a single machine","volume":"47","author":"Liu","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.1937-5956.2000.tb00465.x","article-title":"Combined production and maintenance scheduling for a multipleproduct, single-machine production system","volume":"9","author":"Sloan","year":"2000","journal-title":"Prod. Oper. Manag."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1016\/j.cor.2004.07.016","article-title":"Pareto and scalar bicriterion scheduling of deteriorating jobs","volume":"33","author":"Gawiejnowicz","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"7377","DOI":"10.1080\/00207543.2014.931609","article-title":"Integrated maintenance planning and production scheduling with Markovian deteriorating machine conditions","volume":"52","author":"Bajestani","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.mcm.2004.09.004","article-title":"A note on scheduling deteriorating jobs","volume":"41","author":"Mosheiov","year":"2005","journal-title":"Math. Comput. Model."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","author":"Biskup","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","article-title":"Scheduling problems with a learning effect","volume":"132","author":"Mosheiov","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","article-title":"A state-of-the-art review on scheduling with learning effects","volume":"188","author":"Biskup","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","article-title":"Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation","volume":"11","author":"Gordon","year":"2008","journal-title":"J. Sched."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s00170-008-1760-6","article-title":"Single machine scheduling with a time-dependent deterioration","volume":"43","author":"Wang","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","article-title":"Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect","volume":"174","author":"Kuo","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s00170-008-1421-9","article-title":"A note on single-machine makespan problem with general deteriorating function","volume":"40","author":"Lee","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"2897","DOI":"10.1016\/j.apm.2014.11.002","article-title":"Machine scheduling problems with a position-dependent deterioration","volume":"39","author":"Huang","year":"2015","journal-title":"Appl. Math. Model."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00170-013-4768-5","article-title":"Scheduling with a general learning effect","volume":"67","author":"Yang","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"3127","DOI":"10.1016\/j.ins.2009.05.002","article-title":"Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations","volume":"197","author":"Cheng","year":"2009","journal-title":"Inf. Sci."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","article-title":"Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time","volume":"72","author":"Sun","year":"2021","journal-title":"J. Oper. Res. Soc."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Lv, D.-Y., and Wang, J.-B. (2024). Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng. Optim.","DOI":"10.1080\/0305215X.2024.2372633"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"109317","DOI":"10.1016\/j.cie.2023.109317","article-title":"Scheduling on proportionate flow shop with job rejection and common due date assignment","volume":"181","author":"Geng","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"2250018","DOI":"10.1142\/S021759592250018X","article-title":"A bicriterion approach to due date assignment scheduling in single-machine with position-dependent weights","volume":"40","author":"Sun","year":"2023","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Wang, J.-B., Lv, D.-Y., and Wan, C. (2024). Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights. Asia-Pac. J. Oper. Res.","DOI":"10.1142\/S0217595924500118"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"4441","DOI":"10.1007\/s12190-024-02090-8","article-title":"Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect","volume":"70","author":"Qian","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Bai, B., Wei, C.-M., He, H.-Y., and Wang, J.-B. (2024). Study on single-machine common\/slack due-window assignment scheduling with delivery times, variable processing times and outsourcing. Mathematics, 12.","DOI":"10.3390\/math12182883"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Sun, X., Liu, T., Wang, J.Y., and Geng, X.-N. (2024). Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects. J. Oper. Res. Soc.","DOI":"10.1080\/01605682.2024.2371527"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1057\/jors.2014.91","article-title":"Minimizing total completion time on a single machine with step improving jobs","volume":"66","author":"Kim","year":"2015","journal-title":"J. Oper. Res. Soc."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1080\/01605682.2021.1886616","article-title":"Scheduling of step-improving jobs with an identical improving rate","volume":"73","author":"Kim","year":"2022","journal-title":"J. Oper. Res. Soc."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"108469","DOI":"10.1016\/j.cie.2022.108469","article-title":"A bicriterion single-machine scheduling problem with step-improving processing times","volume":"171","author":"Wu","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1080\/01605682.2023.2203150","article-title":"On scheduling of step-improving jobs to minimize the total weighted completion time","volume":"75","author":"Cheng","year":"2024","journal-title":"J. Oper. Res. Soc."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/3\/153\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:39:03Z","timestamp":1760027943000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/3\/153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,20]]},"references-count":63,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["axioms14030153"],"URL":"https:\/\/doi.org\/10.3390\/axioms14030153","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,20]]}}}