{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T09:00:40Z","timestamp":1718960440129},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T00:00:00Z","timestamp":1433808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-015-9918-2","type":"journal-article","created":{"date-parts":[[2015,6,8]],"date-time":"2015-06-08T09:04:55Z","timestamp":1433754295000},"page":"385-395","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness"],"prefix":"10.1007","volume":"32","author":[{"given":"Qijia","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"9918_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.jpdc.2005.07.006","volume":"66","author":"V Bil\u00f2","year":"2006","unstructured":"Bil\u00f2 V, Flammini M, Moscardelli L (2006) Pareto approximations for the bicriteria scheduling problem. J Parallel Distrib Comput 66:393\u2013402","journal-title":"J Parallel Distrib Comput"},{"key":"9918_CR2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.tcs.2007.04.034","volume":"381","author":"C He","year":"2007","unstructured":"He C, Lin YX, Yuan JJ (2007) Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theor Comput Sci 381:234\u2013240","journal-title":"Theor Comput Sci"},{"key":"9918_CR3","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592\u2013623","journal-title":"Eur J Oper Res"},{"key":"9918_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.21.1.100","volume":"21","author":"JA Hoogeveen","year":"1996","unstructured":"Hoogeveen JA (1996) Minimizing maximum promptness and maximum lateness on a single machine. Math Oper Res 21:100\u2013114","journal-title":"Math Oper Res"},{"key":"9918_CR5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1006\/jagm.1996.0051","volume":"21","author":"JA Hoogeveen","year":"1996","unstructured":"Hoogeveen JA (1996) Single-machine scheduling to minimize a function of two or three maximum cost criteria. J Algorithms 21:415\u2013433","journal-title":"J Algorithms"},{"key":"9918_CR6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjens APA (2000) A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J Discret Math 13:56\u201363","journal-title":"SIAM J Discret Math"},{"key":"9918_CR7","doi-asserted-by":"crossref","unstructured":"Ma R, Yuan JJ (2014) Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time. Int J Prod Econ 158:114\u2013119","DOI":"10.1016\/j.ijpe.2014.07.027"},{"key":"9918_CR8","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28:1436\u20131441","journal-title":"Oper Res"},{"key":"9918_CR9","volume-title":"Handbook of scheduling: algorithm, models, and performance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: algorithm, models, and performance analysis. Chapman and Hall\/CRC, Boca Raton"},{"key":"9918_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C Stein","year":"1997","unstructured":"Stein C, Wein J (1997) On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper Res Lett 21:115\u2013122","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9918-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9918-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9918-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:27Z","timestamp":1559276607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9918-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9918"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9918-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}