{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:08:51Z","timestamp":1648940931806},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00453-007-9083-9","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T15:10:39Z","timestamp":1193670639000},"page":"312-328","source":"Crossref","is-referenced-by-count":4,"title":["Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness"],"prefix":"10.1007","volume":"50","author":[{"given":"Patchrawat \u201cPatch\u201d","family":"Uthaisombut","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"key":"9083_CR1","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974), Chap.\u00a02"},{"issue":"3","key":"9083_CR2","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S0097539703435765","volume":"34","author":"H.-L. Chan","year":"2005","unstructured":"Chan, H.-L., Lam, T.-W., To, K.-K.: Nonmigratory online deadline scheduling on multiprocessors. SIAM J. Comput. 34(3), 669\u2013682 (2005)","journal-title":"SIAM J. Comput."},{"key":"9083_CR3","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/32.58762","volume":"15","author":"M. Dertouzos","year":"1989","unstructured":"Dertouzos, M., Mok, A.: Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Trans. Softw. Eng. 15, 1497\u20131506 (1989)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9083_CR4","unstructured":"Dertouzos, M.L.: Control robotics: the procedural control of physical processes. In: Proceeding of IFIP Congress, pp.\u00a0807\u2013813 (1974)"},{"key":"9083_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9083_CR6","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y., Lam, T.-W., Ngan, T.-W., To, K.-K.: Extra processors versus future information in optimal deadline scheduling. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.\u00a0133\u2013142 (2002)","DOI":"10.1145\/564870.564890"},{"key":"9083_CR7","unstructured":"Lam, T.W., To, K.-K.: Performance guarantee for online deadline scheduling in the presence of overload. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0755\u2013764 (2001)"},{"key":"9083_CR8","doi-asserted-by":"crossref","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp.\u00a0140\u2013149 (1997)","DOI":"10.1145\/258533.258570"},{"key":"9083_CR9","unstructured":"Rasala, A., Stein, C., Torng, E., Uthaisombut, P.: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0723\u2013731 (2002)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9083-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9083-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9083-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9083-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9083"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9083-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}