{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:22:56Z","timestamp":1648506176187},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Electrical Engineering"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0045-7906(00)00025-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:50Z","timestamp":1027634690000},"page":"345-354","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems"],"prefix":"10.1016","volume":"27","author":[{"given":"Bo-Chao","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Alexander D.","family":"Stoyen","sequence":"additional","affiliation":[]},{"given":"Thomas J.","family":"Marlowe","sequence":"additional","affiliation":[]},{"given":"Sanjoy","family":"Baruah","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0045-7906(00)00025-2_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":"8","key":"10.1016\/S0045-7906(00)00025-2_BIB2","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/0305-0548(91)90015-J","article-title":"One machine scheduling to minimize expected mean tardiness. Part I","volume":"18","author":"Cadambi","year":"1991","journal-title":"Comput Oper Res"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB3","unstructured":"Cheng B-C, Stoyenko AD, Marlowe TJ, Baruah S. The allocation and scheduling of precedence- and timing-constrained tasks with communication delays. Fourth Annual IEEE Workshop on Real-Time Applications, RTAW'96, October 21\u201325, Quebec, Canada, 1996"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB4","unstructured":"Cheng B-C. Least space-time first scheduling algorithm: scheduling non-simple tasks with hard deadline on parallel machines. PhD thesis, Department of CIS, New Jersey Institute of Technology, USA, 1996"},{"issue":"5","key":"10.1016\/S0045-7906(00)00025-2_BIB5","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/S0005-1098(96)00245-2","article-title":"A new scheduling policy for complex real-time tasks in multiple processor systems","volume":"33","author":"Cheng","year":"1996","journal-title":"Automatica"},{"issue":"3","key":"10.1016\/S0045-7906(00)00025-2_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1016\/S0045-7906(00)00025-2_BIB7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch-and-bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Res Logist"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J Appl Math"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals Discrete Math"},{"issue":"5","key":"10.1016\/S0045-7906(00)00025-2_BIB10","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems. I. weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Oper Res"},{"issue":"1","key":"10.1016\/S0045-7906(00)00025-2_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1057\/jors.1992.6","article-title":"A heuristic algorithm for sequencing on one machine to minimize total tardiness","volume":"43","author":"Holsenback","year":"1992","journal-title":"J Oper Res Soc"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB12","doi-asserted-by":"crossref","unstructured":"Hu TC. Parallel sequencing and assembly line programs. Oper Res 1961;9:841\u20138","DOI":"10.1287\/opre.9.6.841"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01553887","article-title":"A new algorithm for scheduling periodic, real-time tasks","volume":"4","author":"Leung","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals Discrete Math"},{"issue":"1","key":"10.1016\/S0045-7906(00)00025-2_BIB15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J ACM"},{"issue":"2","key":"10.1016\/S0045-7906(00)00025-2_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1142\/S0218194096000089","article-title":"PERTS: a prototyping environment for real-time systems","volume":"6","author":"Liu","year":"1996","journal-title":"Int J Software Engng Knowledge Engng"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB17","series-title":"CPM in Construction Management, Scheduling by the Critical Path Method","author":"O'Brien","year":"1965"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB18","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0045-7906(00)00025-2_BIB19","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.11.3.460","article-title":"Scheduling with deadlines and loss functions on k parallel machines","volume":"11","author":"Root","year":"1965","journal-title":"Manag Sci"},{"issue":"6","key":"10.1016\/S0045-7906(00)00025-2_BIB20","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/2.386982","article-title":"Implications of classical scheduling results for real-time systems","volume":"28","author":"Stankovic","year":"1995","journal-title":"IEEE Comput"},{"issue":"3\u20134","key":"10.1016\/S0045-7906(00)00025-2_BIB21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02320193","article-title":"On optimal lateness and tardiness scheduling in real-time systems","volume":"47","author":"Stoyenko","year":"1992","journal-title":"Computing"}],"container-title":["Computers &amp; Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790600000252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790600000252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T15:55:50Z","timestamp":1555689350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790600000252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0045790600000252"],"URL":"https:\/\/doi.org\/10.1016\/s0045-7906(00)00025-2","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}