{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T08:09:18Z","timestamp":1675498158051},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Project Production Institute"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10951-021-00698-3","type":"journal-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:02:36Z","timestamp":1628748156000},"page":"431-446","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online scheduling to minimize total weighted (modified) earliness and tardiness cost"],"prefix":"10.1007","volume":"24","author":[{"given":"Arman","family":"Jabbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Kaminsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,12]]},"reference":[{"key":"698_CR1","doi-asserted-by":"publisher","unstructured":"Anderson, E. J. and Potts, C. N. (2004), \u2018Online scheduling of a single machine to minimize total weighted completion time\u2019, Mathematics of Operations Research 29(3), 686\u2013697. https:\/\/doi.org\/10.1287\/moor.1040.0092.","DOI":"10.1287\/moor.1040.0092"},{"key":"698_CR2","doi-asserted-by":"publisher","unstructured":"Kolliopoulos, S. G. and Steiner, G. (2007), \u2018Approximation algorithms for scheduling problems with a modified total weighted tardiness objective\u2019, Operations Research Letters 35(5), 685\u2013692. https:\/\/doi.org\/10.1016\/j.orl.2006.12.002.","DOI":"10.1016\/j.orl.2006.12.002"},{"key":"698_CR3","doi-asserted-by":"publisher","unstructured":"Liu, M., Xu, Y., Chu, C. and Zheng, F. (2009), \u2018Online scheduling to minimize modified total tardiness with an availability constraint\u2019, Theoretical Computer Science 410(47), 5039\u20135046. https:\/\/doi.org\/10.1016\/j.tcs.2009.07.055.","DOI":"10.1016\/j.tcs.2009.07.055"},{"key":"698_CR4","unstructured":"Pruhs, K., Sgall, J. and Torng, E. ( 2004), Online scheduling, in J. Y. Leung, ed., \u2018Handbook of Scheduling - Algorithms, Models, and Performance Analysis\u2019, Chapman and Hall\/CRC."},{"key":"698_CR5","doi-asserted-by":"publisher","unstructured":"Sleator, D. D. and Tarjan, R. E. (1985), \u2018Amortized efficiency of list update and paging rules\u2019, Commun. ACM 28(2), 202\u2013208. https:\/\/doi.org\/10.1145\/2786.2793.","DOI":"10.1145\/2786.2793"},{"key":"698_CR6","doi-asserted-by":"publisher","unstructured":"Vestjens, A. ( 1997), On-line machine scheduling, PhD thesis, Department of Mathematic s and Computer Science. https:\/\/doi.org\/10.6100\/IR500043","DOI":"10.6100\/IR500043"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00698-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00698-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00698-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T06:40:24Z","timestamp":1629787224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00698-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["698"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00698-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"1 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work was supported by a grant from the Project Production Institute.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"N\/A","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests:"}},{"value":"N\/A","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"N\/A","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}