{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:55:27Z","timestamp":1764402927878,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671368","11771406"],"award-info":[{"award-number":["11671368","11771406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10288-019-00410-4","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T11:02:57Z","timestamp":1561719777000},"page":"177-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices"],"prefix":"10.1007","volume":"18","author":[{"given":"Rubing","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-615X","authenticated-orcid":false,"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,22]]},"reference":[{"key":"410_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling: models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin"},{"key":"410_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10951-014-0413-x","volume":"19","author":"N Brauner","year":"2016","unstructured":"Brauner N, Finke G, Shafransky Y, Sledneu D (2016) Lawler\u2019s minmax cost algorithm: optimality conditions and uncertainty. J Sched 19:401\u2013408","journal-title":"J Sched"},{"key":"410_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10878-016-0051-7","volume":"34","author":"N Brauner","year":"2017","unstructured":"Brauner N, Finke G, Shafransky Y (2017) Lawler\u2019s minmax cost problem under uncertainty. J Comb Optim 34:31\u201346","journal-title":"J Comb Optim"},{"key":"410_CR4","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejor.2017.05.021","volume":"263","author":"QQ Chen","year":"2017","unstructured":"Chen QQ, Lin L, Tan ZY, Yan YJ (2017) Coordination mechanisms for scheduling games with proportional deterioration. Eur J Oper Res 263:380\u2013389","journal-title":"Eur J Oper Res"},{"key":"410_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"YS Cheng","year":"2009","unstructured":"Cheng YS, Sun SJ (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194:18\u201327","journal-title":"Eur J Oper Res"},{"key":"410_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.cie.2012.10.010","volume":"64","author":"M Debczynski","year":"2013","unstructured":"Debczynski M, Gawiejnowicz S (2013) Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion. Comput Ind Eng 64:273\u2013279","journal-title":"Comput Ind Eng"},{"key":"410_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s40305-015-0083-1","volume":"3","author":"Y Gao","year":"2015","unstructured":"Gao Y, Yuan JJ (2015) Pareto minimizing total completion time and maximum cost with positional due indices. J Oper Res Soc China 3:381\u2013387","journal-title":"J Oper Res Soc China"},{"key":"410_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.02.004","volume":"25","author":"Y Gao","year":"2017","unstructured":"Gao Y, Yuan JJ (2017) Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discrete Optim 25:105\u2013119","journal-title":"Discrete Optim"},{"key":"410_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"410_CR10","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2006.04.021","volume":"180","author":"S Gawiejnowicz","year":"2007","unstructured":"Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472\u2013478","journal-title":"Eur J Oper Res"},{"key":"410_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin"},{"key":"410_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10479-012-1222-2","volume":"213","author":"S Gawiejnowicz","year":"2014","unstructured":"Gawiejnowicz S, Kononov A (2014) Isomorphic scheduling problems. Ann Oper Res 213:131\u2013145","journal-title":"Ann Oper Res"},{"key":"410_CR13","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.ejor.2008.04.040","volume":"196","author":"S Gawiejnowicz","year":"2009","unstructured":"Gawiejnowicz S, Kurc W, Pankowska L (2009a) Equivalent time-dependent scheduling problems. Eur J Oper Res 196:919\u2013929","journal-title":"Eur J Oper Res"},{"key":"410_CR14","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10951-009-0121-0","volume":"12","author":"S Gawiejnowicz","year":"2009","unstructured":"Gawiejnowicz S, Kurc W, Pankowska L (2009b) Conjugate problems in time-dependent scheduling. J Sched 12:543\u2013553","journal-title":"J Sched"},{"key":"410_CR15","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall NG (1986) Scheduling problems with generalized due dates. IIE Trans 18:220\u2013222","journal-title":"IIE Trans"},{"key":"410_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer, Boston, MA, pp 85\u2013103"},{"key":"410_CR17","first-page":"17","volume":"5","author":"A Kononov","year":"1998","unstructured":"Kononov A (1998) Single machine scheduling problems with processing times proportional to an arbitrary function. Discrete Anal Oper Res 5:17\u201337 (in Russian)","journal-title":"Discrete Anal Oper Res"},{"key":"410_CR18","unstructured":"Lawler EL (1983) Scheduling a single machine to minimize the number of late jobs. Report No. UCB\/CSD 83\/139, Computer Science Division, University of California, Berkeley, USA"},{"key":"410_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. Manag Sci 19:544\u2013546","journal-title":"Manag Sci"},{"key":"410_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Moore JM (1969) A functional equation and its applications to resource allocation and sequencing problems. Manag Sci 16:77\u201384","journal-title":"Manag Sci"},{"key":"410_CR21","first-page":"343","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy AHG, Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Oper Res 1:343\u2013362","journal-title":"Ann Oper Res"},{"key":"410_CR22","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ijpe.2008.11.011","volume":"118","author":"YQ Li","year":"2009","unstructured":"Li YQ, Li G, Sun LY, Xu ZY (2009) Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. Int J Prod Econ 118:424\u2013429","journal-title":"Int J Prod Econ"},{"key":"410_CR23","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2014.05.023","volume":"543","author":"KL Li","year":"2014","unstructured":"Li KL, Liu CB, Li KQ (2014) An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs. Theor Comput Sci 543:46\u201351","journal-title":"Theor Comput Sci"},{"key":"410_CR24","doi-asserted-by":"publisher","first-page":"2290","DOI":"10.1016\/j.apm.2010.11.026","volume":"35","author":"P Liu","year":"2011","unstructured":"Liu P, Yi N, Zhou XY (2011) Two-agent single-machine scheduling problems under increasing linear deterioration. Appl Math Model 35:2290\u20132296","journal-title":"Appl Math Model"},{"key":"410_CR25","first-page":"570","volume":"273","author":"R Ma","year":"2016","unstructured":"Ma R, Tao JP, Yuan JJ (2016) Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl Math Comput 273:570\u2013583","journal-title":"Appl Math Comput"},{"key":"410_CR26","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF01075095","volume":"15","author":"OI Melnikov","year":"1979","unstructured":"Melnikov OI, Shafransky YM (1979) Parametric problem in scheduling theory. Cybernetics 15:352\u2013357","journal-title":"Cybernetics"},{"key":"410_CR27","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s40995-017-0466-8","volume":"42","author":"CX Miao","year":"2018","unstructured":"Miao CX (2018) Complexity of scheduling with proportional deterioration and release dates. Iran J Sci Technol Trans Sci 42:1337\u20131342","journal-title":"Iran J Sci Technol Trans Sci"},{"key":"410_CR28","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2012.08.022","volume":"462","author":"CX Miao","year":"2012","unstructured":"Miao CX, Zhang YZ, Wu CL (2012) Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. Theor Comput Sci 462:80\u201387","journal-title":"Theor Comput Sci"},{"key":"410_CR29","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore JM (1968) An $$n$$ job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15:102\u2013109","journal-title":"Manag Sci"},{"key":"410_CR30","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) Scheduling deteriorating jobs under simple linear deterioration. Comput Oper Res 21:653\u2013659","journal-title":"Comput Oper Res"},{"key":"410_CR31","doi-asserted-by":"publisher","first-page":"3578","DOI":"10.1016\/j.tcs.2010.05.032","volume":"411","author":"CT Ng","year":"2010","unstructured":"Ng CT, Li SS, Cheng TCE, Yuan JJ (2010) Preemptive scheduling with simple linear deterioration on a single machine. Theor Comput Sci 411:3578\u20133586","journal-title":"Theor Comput Sci"},{"key":"410_CR32","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.tcs.2008.11.009","volume":"410","author":"XL Qi","year":"2009","unstructured":"Qi XL, Zhou SG, Yuan JJ (2009) Single machine parallel-batch scheduling with deteriorating jobs. Theor Comput Sci 410:830\u2013836","journal-title":"Theor Comput Sci"},{"key":"410_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist 3:59\u201366","journal-title":"Naval Res Logist"},{"key":"410_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with times-changing effects and rate-modifying activities","author":"V Strusevich","year":"2017","unstructured":"Strusevich V, Rustogi K (2017) Scheduling with times-changing effects and rate-modifying activities. Springer, Berlin"},{"key":"410_CR35","first-page":"10401","volume":"219","author":"CC Wu","year":"2013","unstructured":"Wu CC, Cheng SR, Wu WH, Yin YQ, Wu WH (2013) The single-machine total tardiness problem with unequal release times and a linear deterioration. Appl Math Comput 219:10401\u201310415","journal-title":"Appl Math Comput"},{"key":"410_CR36","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2013.02.024","volume":"487","author":"S Yu","year":"2013","unstructured":"Yu S, Wong PWH (2013) Online scheduling of simple linear deteriorating jobs to minimize the total general completion time. Theor Comput Sci 487:95\u2013102","journal-title":"Theor Comput Sci"},{"key":"410_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-016-0479-8","volume":"20","author":"JJ Yuan","year":"2017","unstructured":"Yuan JJ (2017) Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J Sched 20:211\u2013218","journal-title":"J Sched"},{"key":"410_CR38","unstructured":"Zhao QL, Yuan JJ (2017) Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs. Asia Pac J Oper Res 34:12, Article ID: 1750024"},{"key":"410_CR39","first-page":"531","volume":"29","author":"CL Zhao","year":"2003","unstructured":"Zhao CL, Zhang QL, Tang HY (2003) Scheduling problems under linear deterioration. Acta Autom Sin 29:531\u2013535","journal-title":"Acta Autom Sin"},{"key":"410_CR40","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10288-016-0308-0","volume":"14","author":"QL Zhao","year":"2016","unstructured":"Zhao QL, Lu LF, Yuan JJ (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR Q J Oper Res 14:261\u2013280","journal-title":"4OR Q J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00410-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-019-00410-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00410-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T23:11:37Z","timestamp":1592694697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-019-00410-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,22]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s10288-019-00410-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2019,6,22]]},"assertion":[{"value":"18 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}