{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:09:09Z","timestamp":1765886949018},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":1965,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1016\/j.jda.2006.07.005","type":"journal-article","created":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T07:33:40Z","timestamp":1161848020000},"page":"3-10","source":"Crossref","is-referenced-by-count":16,"title":["On-line scheduling of parallel jobs on two machines"],"prefix":"10.1016","volume":"6","author":[{"given":"Wun-Tat","family":"Chan","sequence":"first","affiliation":[]},{"given":"Francis Y.L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.jda.2006.07.005_bib001","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(00)00260-7","article-title":"On-line scheduling of parallel jobs with runtime restrictions","volume":"268","author":"Bischof","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2006.07.005_bib002","series-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","article-title":"Scheduling parallel tasks\u2014algorithms and complexity","author":"Drozdowski","year":"2004"},{"issue":"4","key":"10.1016\/j.jda.2006.07.005_bib003","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1009794729459","article-title":"Optimal on-line scheduling of parallel jobs with dependencies","volume":"1","author":"Feldmann","year":"1998","journal-title":"J. Comb. Optim."},{"issue":"6","key":"10.1016\/j.jda.2006.07.005_bib004","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0020-0190(01)00241-1","article-title":"On an on-line scheduling problem for parallel jobs","volume":"81","author":"Naroska","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jda.2006.07.005_bib005","series-title":"Proceedings of the 10th International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2004)","first-page":"1","article-title":"Parallel job scheduling\u2014a status report","volume":"vol. 3277","author":"Feitelson","year":"2004"},{"key":"10.1016\/j.jda.2006.07.005_bib006","series-title":"Proceedings of the 11th International Colloquium of Structural Information and Communication Complexity (SIROCCO 2004)","first-page":"279","article-title":"On-line scheduling of parallel jobs","volume":"vol. 3104","author":"Ye","year":"2004"},{"key":"10.1016\/j.jda.2006.07.005_bib007","author":"Johannes"},{"key":"10.1016\/j.jda.2006.07.005_bib008","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/j.jda.2006.07.005_bib009","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/j.jda.2006.07.005_bib010","first-page":"107","article-title":"On the performance of on-line algorithms for partition problems","volume":"9","author":"Faigle","year":"1989","journal-title":"Acta Cybern."},{"key":"10.1016\/j.jda.2006.07.005_bib011","unstructured":"D. Ye, On-line and efficient algorithms for scheduling problems in communication networks, PhD thesis, Zhejiang University, Hangzhou, China, 2005"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866706000761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866706000761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T17:51:44Z","timestamp":1547229104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866706000761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["S1570866706000761"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2006.07.005","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}