{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T03:24:49Z","timestamp":1774841089435,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00453-014-9940-2","type":"journal-article","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T11:00:26Z","timestamp":1412074826000},"page":"156-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Online Scheduling of Jobs with Fixed Start Times on Related Machines"],"prefix":"10.1007","volume":"74","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"9940_CR1","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive non-preemptive call control. In Proceedings of the of 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201994), pp. 312\u2013320 (1994)"},{"key":"9940_CR2","doi-asserted-by":"crossref","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 online realtime task scheduling. J. Real-time Syst. 4, 125\u2013144 (1992)","journal-title":"J. Real-time Syst."},{"issue":"4","key":"9940_CR3","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R Canetti","year":"1998","unstructured":"Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993\u20131015 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9940_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Appl. Math. 59(3), 225\u2013235 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"34\u201336","key":"9940_CR5","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 411(34\u201336), 3129\u20133135 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"9940_CR6","doi-asserted-by":"crossref","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":"9940_CR7","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.ipl.2012.01.015","volume":"112","author":"SPY Fung","year":"2012","unstructured":"Fung, S.P.Y., Poon, C.K., Yung, D.K.W.: On-line scheduling of equal-length intervals on parallel machines. Info. Process. Lett. 112(10), 376\u2013379 (2012)","journal-title":"Info. Process. Lett."},{"key":"9940_CR8","doi-asserted-by":"crossref","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Improved randomized online scheduling of unit length intervals and jobs. In Proceedings of the 6th International Workshop on Approximation and Online Algorithms (WAOA\u201908), pp. 53\u201366 (2008)","DOI":"10.1007\/978-3-540-93980-1_5"},{"issue":"3","key":"9940_CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"SPY Fung","year":"2008","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Online interval scheduling: randomized and multiprocessor cases. J. Combin. Optim. 16(3), 248\u2013262 (2008)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"9940_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s00224-013-9528-2","volume":"55","author":"SPY Fung","year":"2014","unstructured":"Fung, S.P.Y., 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":"4","key":"9940_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"key":"9940_CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0304-3975(02)00407-3","volume":"295","author":"C-Y Koo","year":"2003","unstructured":"Koo, C.-Y., Lam, T.W., Ngan, T.-W., Sadakane, K., To, K.-K.: On-line scheduling with tight deadlines. Theoret. Comput. Sci. 295, 251\u2013261 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"9940_CR13","doi-asserted-by":"crossref","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":"4\u20135","key":"9940_CR14","doi-asserted-by":"crossref","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\u20135), 171\u2013177 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9940_CR15","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 130(1), 5\u201316 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9940-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9940-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9940-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T13:06:57Z","timestamp":1565874417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9940-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9940"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9940-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}