{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:54:22Z","timestamp":1767192862674,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971443","11571321"],"award-info":[{"award-number":["11971443","11571321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771406","61971380"],"award-info":[{"award-number":["11771406","61971380"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Scientific Research Foundation of the Higher Education Institutions of Henan Province","award":["20A110003"],"award-info":[{"award-number":["20A110003"]}]},{"name":"Doctor Foundation of Henan University of Technology","award":["2019BS042"],"award-info":[{"award-number":["2019BS042"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00557-5","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T04:18:08Z","timestamp":1583727488000},"page":"1900-1912","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Online scheduling on a single machine with linear deteriorating processing times and delivery times"],"prefix":"10.1007","volume":"44","author":[{"given":"Xing","family":"Chai","sequence":"first","affiliation":[]},{"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Libo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"issue":"7","key":"557_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B Alidaee","year":"1999","unstructured":"Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50(7):711\u2013720","journal-title":"J Oper Res Soc"},{"key":"557_CR2","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"3","key":"557_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38(3):495\u2013498","journal-title":"Oper Res"},{"issue":"5","key":"557_CR4","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s11741-007-0503-3","volume":"11","author":"MB Cheng","year":"2007","unstructured":"Cheng MB, Sun SJ (2007) A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs. J Shanghai Univ 11(5):451\u2013456","journal-title":"J Shanghai Univ"},{"issue":"1","key":"557_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152(1):1\u201313","journal-title":"Eur J Oper Res"},{"key":"557_CR6","doi-asserted-by":"publisher","first-page":"5333","DOI":"10.1016\/j.tcs.2011.06.011","volume":"412","author":"Y Fang","year":"2011","unstructured":"Fang Y, Lu XW, Liu PH (2011) Online batch scheduling on parallel machines with delivery times. Theor Comput Sci 412:5333\u20135339","journal-title":"Theor Comput Sci"},{"issue":"4","key":"557_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JND Gupta","year":"1988","unstructured":"Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14(4):387\u2013393","journal-title":"Comput Ind Eng"},{"issue":"1","key":"557_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjean APA (2000) A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM J Discrete Math 13(1):56\u201363","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"557_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","volume":"47","author":"AS Kunnathur","year":"1990","unstructured":"Kunnathur AS, Gupta SK (1990) Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Oper Res 47(1):56\u201364","journal-title":"Eur J Oper Res"},{"key":"557_CR10","series-title":"Logistics of production and inventory","first-page":"445","volume-title":"Handbooks in operation research and management science","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Zipkin PH, Rinnooy Kan AHG (eds) Handbooks in operation research and management science, vol 4. Logistics of production and inventory. North-Holland, Amsterdam, pp 445\u2013522"},{"key":"557_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10878-014-9706-4","volume":"29","author":"PH Liu","year":"2015","unstructured":"Liu PH, Lu XW (2015a) Online unbounded batch scheduling on parallel machines with delivery times. J Comb Optim 29:228\u2013236","journal-title":"J Comb Optim"},{"key":"557_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-014-9760-y","volume":"30","author":"PH Liu","year":"2015","unstructured":"Liu PH, Lu XW (2015b) Online scheduling on two parallel machines with release dates and delivery times. J Comb Optim 30:347\u2013359","journal-title":"J Comb Optim"},{"key":"557_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2012.05.004","volume":"445","author":"M Liu","year":"2012","unstructured":"Liu M, Zheng FF, Wang SJ, Huo JZ (2012) Optimal algorithms for online single machine scheduling with deteriorating jobs. Theor Comput Sci 445:75\u201381","journal-title":"Theor Comput Sci"},{"issue":"6","key":"557_CR14","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 jobs under simple linear deterioration. Comput Oper Res 21(6):653\u2013659","journal-title":"Comput Oper Res"},{"key":"557_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2006.12.001","volume":"374","author":"J Tian","year":"2007","unstructured":"Tian J, Fu RY, Yuan JJ (2007) Online scheduling with delivery time on a single batch machine. Theor Comput Sci 374:49\u201357","journal-title":"Theor Comput Sci"},{"key":"557_CR16","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.dam.2011.12.002","volume":"160","author":"J Tian","year":"2012","unstructured":"Tian J, Cheng TCE, Ng CT, Yuan JJ (2012) An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Appl Math 160:1191\u20131210","journal-title":"Discrete Appl Math"},{"key":"557_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s40305-014-0060-0","volume":"2","author":"J Tian","year":"2014","unstructured":"Tian J, Fu RY, Yuan JJ (2014) Online over time scheduling on parallel-batch machines: a survey. J Oper Res Soc China 2:445\u2013454","journal-title":"J Oper Res Soc China"},{"key":"557_CR18","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":"557_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10878-007-9108-y","volume":"17","author":"JJ Yuan","year":"2009","unstructured":"Yuan JJ, Li SS, Tian J, Fu RY (2009) A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J Comb Optim 17:206\u2013213","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00557-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00557-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00557-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:46:57Z","timestamp":1664354817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00557-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00557-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"9 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}