{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:35:26Z","timestamp":1648809326659},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)00217-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:30:26Z","timestamp":1027614626000},"page":"169-197","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of coordinated display of multimedia objects"],"prefix":"10.1016","volume":"242","author":[{"given":"Martha L.","family":"Escobar-Molano","sequence":"first","affiliation":[]},{"given":"Shahram","family":"Ghandeharizadeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00217-5_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/S0304-3975(98)00217-5_BIB2","first-page":"190","volume":"42","author":"Choi","year":"1993","journal-title":"Managing locality sets: the model and fixed-size buffers, IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(98)00217-5_BIB3","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","article-title":"Scheduling file transfers","volume":"14","author":"Coffman","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(98)00217-5_BIB4","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/69.506717","article-title":"An optimal resource scheduler for continuous display of structured video objects","volume":"8","author":"Escobar-Molano","year":"1996","journal-title":"IEEE Trans. Knowledge Data Eng."},{"issue":"4","key":"10.1016\/S0304-3975(98)00217-5_BIB5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(98)00217-5_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(98)00217-5_BIB7","doi-asserted-by":"crossref","unstructured":"L. McGeoch, D. Sleator (Eds.), On-Line Algorithms, No.7, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, February 1991.","DOI":"10.1090\/dimacs\/007"},{"key":"10.1016\/S0304-3975(98)00217-5_BIB8","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1002\/net.3230220606","article-title":"Scheduling file transfers in fully connected networks","volume":"2","author":"Rivera-Vega","year":"1992","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0304-3975(98)00217-5_BIB9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(98)00217-5_BIB10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0219015","article-title":"The complexity of file transfer scheduling with forwarding","volume":"19","author":"Whitehead","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T03:59:15Z","timestamp":1579147155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397598002175"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00217-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}