{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:48:49Z","timestamp":1762300129496,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Key Research Projects of Henan Higher Education Institutions","award":["20A110037"],"award-info":[{"award-number":["20A110037"]}]},{"name":"Young Backbone Teachers training program of Zhongyuan University of Technology","award":["2018XQG15"],"award-info":[{"award-number":["2018XQG15"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00890-x","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T19:12:13Z","timestamp":1659467533000},"page":"1330-1355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing total weighted late work on a single-machine with non-availability intervals"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Ren-Xia","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,2]]},"reference":[{"key":"890_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I Adiri","year":"1989","unstructured":"Adiri I, Bruno J, Frostig E, Rinnooy Kan AHG (1989) Single machine flowtime scheduling with a single breakdown. Acta Informatica 26:679\u2013696","journal-title":"Acta Informatica"},{"key":"890_CR2","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques 3:415\u2013420","journal-title":"Technique et Science Informatiques"},{"key":"890_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10951-018-0585-x","volume":"22","author":"K B\u00fclb\u00fcl","year":"2019","unstructured":"B\u00fclb\u00fcl K, Kedad-Sidhoum S, Sen H (2019) Single-machine common due date total earliness\/tardiness scheduling with machine unavailability. J Sched 22:543\u2013565","journal-title":"J Sched"},{"key":"890_CR4","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1002\/nav.21869","volume":"66","author":"RB Chen","year":"2019","unstructured":"Chen RB, Yuan JJ, Ng CT, Cheng TCE (2019) Single-machine scheduling with deadlines to minimize the total weighted late work. Nav Res Logist 66:582\u2013595","journal-title":"Nav Res Logist"},{"key":"890_CR5","doi-asserted-by":"publisher","first-page":"107525","DOI":"10.1016\/j.cie.2021.107525","volume":"159","author":"RB Chen","year":"2021","unstructured":"Chen RB, Yuan JJ, Ng CT, Cheng TCE (2021) Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Computers & Industrial Engineering 159:107525","journal-title":"Computers & Industrial Engineering"},{"key":"890_CR6","doi-asserted-by":"publisher","first-page":"2050046","DOI":"10.1142\/S0217595920500463","volume":"38","author":"RX Chen","year":"2021","unstructured":"Chen RX, Li SS (2021) Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs. Asia-Pacific J Oper Res 38:2050046","journal-title":"Asia-Pacific J Oper Res"},{"key":"890_CR7","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AMA Hariri","year":"1995","unstructured":"Hariri AMA, Potts CN, Van Wassenhove LN (1995) Single machine scheduling to minimize total late work. ORSA J Comput 7:232\u2013242","journal-title":"ORSA J Comput"},{"key":"890_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2006.04.014","volume":"363","author":"Y He","year":"2006","unstructured":"He Y, Zhong W, Gu H (2006) Improved algorithms for two single machine scheduling problems. Theoret Comput Sci 363:257\u2013265","journal-title":"Theoret Comput Sci"},{"key":"890_CR9","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-021-00697-2","volume":"41","author":"RY He","year":"2021","unstructured":"He RY, Yuan JJ, Ng CT, Cheng TCE (2021) Two-agent preemptive Pareto scheduling to minimize the number of tardy jobs and total late work. J Comb Optim 41:504\u2013525","journal-title":"J Comb Optim"},{"key":"890_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.cie.2007.08.005","volume":"54","author":"I Kacem","year":"2008","unstructured":"Kacem I (2008) Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering 54:401\u2013410","journal-title":"Computers & Industrial Engineering"},{"key":"890_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10878-007-9102-4","volume":"17","author":"I Kacem","year":"2009","unstructured":"Kacem I (2009) Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J Comb Optim 17:117\u2013133","journal-title":"J Comb Optim"},{"key":"890_CR12","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.cor.2006.04.010","volume":"35","author":"I Kacem","year":"2008","unstructured":"Kacem I, Chu C, Souissi A (2008) Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Computers & Operations Research 35:827\u2013844","journal-title":"Computers & Operations Research"},{"key":"890_CR13","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1007\/s00453-018-0417-6","volume":"80","author":"I Kacem","year":"2018","unstructured":"Kacem I, Kellerer H (2018) Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints. Algorithmica 80:3825\u20133843","journal-title":"Algorithmica"},{"key":"890_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10878-013-9643-7","volume":"30","author":"I Kacem","year":"2015","unstructured":"Kacem I, Kellerer H, Lanuel Y (2015) Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J Comb Optim 30:403\u2013412","journal-title":"J Comb Optim"},{"key":"890_CR15","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1007\/s10878-015-9924-4","volume":"32","author":"I Kacem","year":"2016","unstructured":"Kacem I, Kellerer H, Seifaddini M (2016) Efficient approximation schemes for the maximum delivery time minimization on a single machine with a fixed operator or machine non-availability interval. J Comb Optim 32:970\u2013981","journal-title":"J Comb Optim"},{"key":"890_CR16","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cie.2008.09.042","volume":"56","author":"I Kacem","year":"2009","unstructured":"Kacem I, Mahjoub AR (2009) Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering 56:1708\u20131712","journal-title":"Computers & Industrial Engineering"},{"key":"890_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer H, Strusevich VA (2010) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica 57:769\u2013795","journal-title":"Algorithmica"},{"key":"890_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/moor.19.1.86","volume":"19","author":"MY Kovalyov","year":"1994","unstructured":"Kovalyov MY, Potts CN, Van Wassenhove LN (1994) A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Math Oper Res 19:86\u201393","journal-title":"Math Oper Res"},{"key":"890_CR19","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manage Sci 19:544\u2013546","journal-title":"Manage Sci"},{"key":"890_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee CY (1996) Machine scheduling with an availability constraint. J Global Optim 9:395\u2013416","journal-title":"J Global Optim"},{"key":"890_CR21","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"CY Lee","year":"1992","unstructured":"Lee CY, Liman SD (1992) Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29:375\u2013382","journal-title":"Acta Informatica"},{"key":"890_CR22","volume-title":"Minimizing total weighted error for imprecise computation tasks and related problems. In Handbook of scheduling: Algorithms, models, and performance analysis","author":"JYT Leung","year":"2004","unstructured":"Leung JYT (2004) Minimizing total weighted error for imprecise computation tasks and related problems. In Handbook of scheduling: Algorithms, models, and performance analysis. Chapman and Hall\/CRC, Boca Raton"},{"key":"890_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-020-00646-7","volume":"23","author":"SS Li","year":"2020","unstructured":"Li SS, Yuan JJ (2020) Single-machine scheduling with multi-agents to minimize total weighted late work. J Sched 23:497\u2013512","journal-title":"J Sched"},{"key":"890_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering 58:199\u2013211","journal-title":"Computers & Industrial Engineering"},{"key":"890_CR25","doi-asserted-by":"crossref","unstructured":"Mor B, Shapira D (2022) Single machine scheduling with non-availability interval and optional job rejection. J Comb Optim 44:480\u2013497","DOI":"10.1007\/s10878-022-00845-2"},{"key":"890_CR26","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Oron D, Shabtay D (2021) Minimizing total late work on a single machine with generalized due-dates. Eur J Oper Res 293:837\u2013846","journal-title":"Eur J Oper Res"},{"key":"890_CR27","volume-title":"Maintenance planning and scheduling handbook","author":"D Palmer","year":"2012","unstructured":"Palmer D (2012) Maintenance planning and scheduling handbook, 3rd edn. McGraw Hill, New York","edition":"3"},{"key":"890_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo M (2016) Scheduling: theory, algorithms and systems, 5th edn. Prentice-Hall, Springer","edition":"5"},{"key":"890_CR29","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1991","unstructured":"Potts CN, Van Wassenhove LN (1991) Single machine scheduling to minimize total late work. Oper Res 40:586\u2013595","journal-title":"Oper Res"},{"key":"890_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1992","unstructured":"Potts CN, Van Wassenhove LN (1992) Approximation algorithms for scheduling a single machine to minimize total late work. Oper Res Lett 11:261\u2013266","journal-title":"Oper Res Lett"},{"key":"890_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"C Sadfi","year":"2005","unstructured":"Sadfi C, Penz B, Rapine C, Blazewicz J, Formanowicz P (2005) An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur J Oper Res 161:3\u201310","journal-title":"Eur J Oper Res"},{"key":"890_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H","volume":"2","author":"M Scharbrodt","year":"1999","unstructured":"Scharbrodt M, Steger A, Weisser H (1999) Approximability of scheduling with fixed jobs. J Sched 2:267\u2013284","journal-title":"J Sched"},{"key":"890_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1057\/jors.1988.44","volume":"39","author":"G Schmidt","year":"1988","unstructured":"Schmidt G (1988) Scheduling independent tasks with deadlines on semi-identical processors. J Operational Research Society 39:271\u2013277","journal-title":"J Operational Research Society"},{"key":"890_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1\u201315","journal-title":"Eur J Oper Res"},{"key":"890_CR35","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"key":"890_CR36","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2021.03.034","volume":"296","author":"D Shabtay","year":"2022","unstructured":"Shabtay D (2022) Single-machine scheduling with machine unavailability periods and resource dependent processing times. Eur J Oper Res 296:423\u2013439","journal-title":"Eur J Oper Res"},{"key":"890_CR37","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ejor.2017.08.034","volume":"266","author":"A Shioura","year":"2018","unstructured":"Shioura A, Shakhlevich NV, Strusevich VA (2018) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur J Oper Res 266:795\u2013818","journal-title":"Eur J Oper Res"},{"key":"890_CR38","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120\u2013129","journal-title":"Omega"},{"key":"890_CR39","doi-asserted-by":"publisher","first-page":"102453","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna M (2021) Late and early work scheduling: A survey. Omega 104:102453","journal-title":"Omega"},{"key":"890_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"V Strusevich","year":"2017","unstructured":"Strusevich V, Rustogi K (2017) Scheduling with time-changing effects and rate-modifying activities. Springer, Berlin"},{"key":"890_CR41","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G Wang","year":"2005","unstructured":"Wang G, Sun H, Chu C (2005) Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann Oper Res 133:183\u2013192","journal-title":"Ann Oper Res"},{"key":"890_CR42","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/nav.21684","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Xu J, Cheng TCE, Wu CC, Wang DJ (2016) Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work. Nav Res Logist 63:172\u2013183","journal-title":"Nav Res Logist"},{"key":"890_CR43","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1142\/S0217595908001778","volume":"25","author":"JJ Yuan","year":"2008","unstructured":"Yuan JJ, Shi L, Ou JW (2008) Single machine scheduling with forbidden intervals and job delivery times. Asia-Pacific J Oper Res 25:317\u2013325","journal-title":"Asia-Pacific J Oper Res"},{"key":"890_CR44","first-page":"126286","volume":"406","author":"X Zhang","year":"2021","unstructured":"Zhang X (2021) Two competitive agents to minimize the weighted total late work and the total completion time. Appl Math Comput 406:126286","journal-title":"Appl Math Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00890-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00890-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00890-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T08:14:37Z","timestamp":1666512877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00890-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["890"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00890-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"20 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}