{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:23Z","timestamp":1740145163356,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,8]],"date-time":"2017-09-08T00:00:00Z","timestamp":1504828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,9,8]],"date-time":"2017-09-08T00:00:00Z","timestamp":1504828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0100"],"award-info":[{"award-number":["FA9550-15-1-0100"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11590-017-1191-0","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T13:59:14Z","timestamp":1505138354000},"page":"251-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Online C-benevolent job scheduling on multiple machines"],"prefix":"10.1007","volume":"12","author":[{"given":"Ge","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9042-8750","authenticated-orcid":false,"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,8]]},"reference":[{"issue":"1","key":"1191_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"EM Arkin","year":"1987","unstructured":"Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18(1), 1\u20138 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1191_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1191_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"S Baruah","year":"1992","unstructured":"Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real Time Syst. 4(2), 125\u2013144 (1992)","journal-title":"Real Time Syst."},{"issue":"6","key":"1191_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jos.85","volume":"4","author":"B DasGupta","year":"2001","unstructured":"DasGupta, B., Palis, M.A.: Online real-time preemptive scheduling of jobs with deadlines on multiple machines. J. Sched. 4(6), 297\u2013312 (2001)","journal-title":"J. Sched."},{"issue":"1","key":"1191_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s00453-014-9940-2","volume":"74","author":"L Epstein","year":"2016","unstructured":"Epstein, L., Je\u017c, \u0141., Sgall, J., van Stee, R.: Online scheduling of jobs with fixed start times on related machines. Algorithmica 74(1), 156\u2013176 (2016)","journal-title":"Algorithmica"},{"issue":"34\u201336","key":"1191_CR6","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.1016\/j.tcs.2010.04.042","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Levin, A.: Improved randomized results for the interval selection problem. Theor. Comput. Sci. 411(34\u201336), 3129\u20133135 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1191_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L Epstein","year":"2004","unstructured":"Epstein, L., Sgall, J., et al.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39(1), 43\u201357 (2004)","journal-title":"Algorithmica"},{"key":"1191_CR8","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Spieksma, F.C.: Simple algorithms for a weighted interval selection problem. In: International Symposium on Algorithms and Computation, pp. 228\u2013240. Springer (2000)","DOI":"10.1007\/3-540-40996-3_20"},{"issue":"1","key":"1191_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0196-6774(02)00291-2","volume":"46","author":"T Erlebach","year":"2003","unstructured":"Erlebach, T., Spieksma, F.C.: Interval selection: applications, algorithms, and lower bounds. J. Algorithms 46(1), 27\u201353 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"1191_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","volume":"58","author":"U Faigle","year":"1995","unstructured":"Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discrete Appl. Math. 58(1), 13\u201317 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"1191_CR11","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ipl.2012.01.015","volume":"112","author":"SP Fung","year":"2012","unstructured":"Fung, S.P., Poon, C.K., Yung, D.K.: On-line scheduling of equal-length intervals on parallel machines. Inf. Process. Lett. 112(10), 376\u2013379 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"1191_CR12","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"SP Fung","year":"2008","unstructured":"Fung, S.P., Poon, C.K., Zheng, F.: Online interval scheduling: randomized and multiprocessor cases. J. Comb. Optim. 16(3), 248\u2013262 (2008)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1191_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00224-013-9528-2","volume":"55","author":"SP Fung","year":"2014","unstructured":"Fung, S.P., Poon, C.K., Zheng, F.: Improved randomized online scheduling of intervals and jobs. Theory Comput. Syst. 55(1), 202\u2013228 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"1191_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M.Y., Ng, C., Cheng, T.E.: Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2), 331\u2013342 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"1191_CR15","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1016\/j.cor.2011.03.001","volume":"38","author":"SO Krumke","year":"2011","unstructured":"Krumke, S.O., Thielen, C., Westphal, S.: Interval scheduling on related machines. Comput. Oper. Res. 38(12), 1836\u20131844 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1191_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"EL Lawler","year":"1990","unstructured":"Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26(1), 125\u2013133 (1990)","journal-title":"Ann. Oper. Res."},{"key":"1191_CR17","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: SODA, vol. 94, pp. 302\u2013311 (1994)","DOI":"10.1111\/j.1949-8594.1994.tb15679.x"},{"issue":"4","key":"1191_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:JOSH.0000031423.39762.d3","volume":"7","author":"H Miyazawa","year":"2004","unstructured":"Miyazawa, H., Erlebach, T.: An improved randomized on-line algorithm for a weighted interval selection problem. J. Sched. 7(4), 293\u2013311 (2004)","journal-title":"J. Sched."},{"issue":"4","key":"1191_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(98)00019-4","volume":"22","author":"SS Seiden","year":"1998","unstructured":"Seiden, S.S.: Randomized online interval scheduling. Oper. Res. Lett. 22(4), 171\u2013177 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1191_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theor. Comput. Sci. 130(1), 5\u201316 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1191-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1191-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1191-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:47:04Z","timestamp":1589651224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1191-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,8]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1191"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1191-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,9,8]]},"assertion":[{"value":"15 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}