{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:19:20Z","timestamp":1649002760570},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf00364958","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T13:40:20Z","timestamp":1099402820000},"page":"247-273","source":"Crossref","is-referenced-by-count":5,"title":["A study on the timeliness property in real-time systems"],"prefix":"10.1007","volume":"3","author":[{"given":"Ken","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"CR1","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.26.6.633","volume":"26","author":"P.C. Bagga","year":"1980","unstructured":"BaggaP.C., and KalraK.R. 1980. A Node Elimination Procedure for Towsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem. Manag. Science, 26, (6): 633?636.","journal-title":"Manag. Science"},{"key":"CR2","volume-title":"Theory of scheduling","author":"R.W. Conway","year":"1967","unstructured":"ConwayR.W., MaxwellW.L., and MillerL.W. 1967. Theory of scheduling. Reading, MA: Addison-Wesley."},{"key":"CR3","volume-title":"Computer and Job-Shop Scheduling Theory","author":"E.G. Coffman Jr.","year":"1976","unstructured":"CoffmanE.G.Jr. 1976. Computer and Job-Shop Scheduling Theory. New York: Wiley and Sons."},{"key":"CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"GareyM.R., and JohnsonD.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman."},{"issue":"5","key":"CR5","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1287\/mnsc.30.5.644","volume":"30","author":"S.K. Gupta","year":"1984","unstructured":"GuptaS.K., and SenT. 1984. On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure. Manag. Science, 30, (5): 644?647.","journal-title":"Manag. Science"},{"issue":"1","key":"CR6","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"HeldM. and KarpR.M. 1962. A Dynamic Programming Approach to Sequencing Problems. J. SIAM, 10, (1): 196?210.","journal-title":"J. SIAM"},{"key":"CR7","unstructured":"Jensen, E.D., Locke, C.D. and Tokuda, H. 1985. A Time-driven scheduling Model for Real-Time Operating System. IEEE Real-Time Symposium, pp: 112?122."},{"key":"CR8","volume-title":"The Art of Computer Programming, Volume One: Fundamental Algorithms","author":"D.E. Knuth","year":"1969","unstructured":"KnuthD.E. 1969. The Art of Computer Programming, Volume One: Fundamental Algorithms. Reading, MA: Addison-Wesley."},{"key":"CR9","unstructured":"Le Lann, G. 1990. Critical issues for the development of distributed real-time computing systems. INRIA Research Report RR-1274."},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C.L. Liu","year":"1973","unstructured":"LiuC.L., and LaylandJ.W. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM, 20, (1): 46?61.","journal-title":"J. ACM"},{"issue":"1","key":"CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E.L. Lawler","year":"1969","unstructured":"LawlerE.L., and MooreJ.M. 1969. A Functional Equation and its Application to Resource Allocation and Sequencing Problems. Manag. Science, 16, (1): 77?84.","journal-title":"Manag. Science"},{"key":"CR12","unstructured":"Northcutt, J.D. 1988. The Alpha Operating System: Requirements and Rationale. Archons Project Tech. Rep. No. 88011."},{"issue":"5","key":"CR13","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1287\/opre.36.5.742","volume":"36","author":"M.E. Posner","year":"1988","unstructured":"PosnerM.E. 1988. The deadline constrained completion time problem: analysis of a heuristic. Oper. Res; 36, (5): 742?746.","journal-title":"Oper. Res"},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"SahniS. 1976. Algorithm for Scheduling Independent Tasks. J. ACM, 23, (1): 116?127.","journal-title":"J. ACM"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0208020","volume":"8","author":"S. Sahni","year":"1979","unstructured":"SahniS., and ChoY-K. 1979. Nearly on line scheduling for a uniform processor system with release times. SIAM J. Comp., 8: 275?285.","journal-title":"SIAM J. Comp."},{"issue":"12","key":"CR16","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1287\/mnsc.34.12.1480","volume":"34","author":"W. Szwarc","year":"1989","unstructured":"SzwarcW., PosnerM.E., and LiuJ. 1989. The Single Machine Problem with a Quadratic Cost Function of Completion Time. Manag. Science, 34, (12): 1480?1488.","journal-title":"Manag. Science"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02341920","volume":"1","author":"B. Sprunt","year":"1989","unstructured":"SpruntB., ShaL. and LehoczkyJ. 1989. Aperiodic Task Scheduling for Hard-Real-Time Systems. J. Real-time Syst., 1: 27?60.","journal-title":"J. Real-time Syst."},{"issue":"10","key":"CR18","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/2.7053","volume":"21","author":"J.A. Stankovic","year":"1988","unstructured":"StankovicJ.A. 1988. Misconceptions about Real-Time Computing, A Serious Problem for Next-generation Systems. IEEE Computer, 21(10): 10?19.","journal-title":"IEEE Computer"},{"issue":"5","key":"CR19","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/mnsc.24.5.530","volume":"24","author":"W. Townsend","year":"1978","unstructured":"TownsendW. 1978. The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branchand-Bound Solution. Manag. Science, 24, (5): 530?534.","journal-title":"Manag. Science"},{"key":"CR20","unstructured":"Tokuda, H., Wendor, J.W., and Wang, H-Y. 1987. Implementation of a Time-driven Scheduler for Real-Time Operating Systems. IEEE Real-Time Symposium, pp: 271?280."},{"issue":"10","key":"CR21","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1287\/mnsc.27.10.1209","volume":"27","author":"H.J. Weiss","year":"1981","unstructured":"WeissH.J. 1981. A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints. Manag. Science, 27, (10): 1209?1216.","journal-title":"Manag. Science"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Wendor, J.W. 1988. Implementation and Evaluation of a Time-driven Scheduling Processor. IEEE Real-Time Symposium, pp: 172?180.","DOI":"10.1109\/REAL.1988.51113"},{"issue":"8","key":"CR23","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1109\/TC.1987.5009518","volume":"36","author":"W. Zhao","year":"1987","unstructured":"ZhaoW., RamamrithamK., and StankovicJ.A. 1987. Preemptive Scheduling Under Time and Resource Constraints. IEEE Trans. Computer, 36, (8): 949?960.","journal-title":"IEEE Trans. Computer"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00364958.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00364958\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00364958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:27:49Z","timestamp":1554776869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00364958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF00364958"],"URL":"https:\/\/doi.org\/10.1007\/bf00364958","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}