{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:52:37Z","timestamp":1761933157012,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0164-1212(87)90041-0","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:49:55Z","timestamp":1060318195000},"page":"195-205","source":"Crossref","is-referenced-by-count":47,"title":["Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints"],"prefix":"10.1016","volume":"7","author":[{"given":"Wei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krithi","family":"Ramamritham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(87)90041-0_BIB1","series-title":"Performance of Computer Systems","article-title":"Scheduling under Resource Constraints\u2014Achievements and Prospects","author":"Blazewicz","year":"1979"},{"key":"10.1016\/0164-1212(87)90041-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(79)90143-1","article-title":"Deadline Scheduling of Tasks with Ready Times and Resource Constraints","volume":"8","author":"Blazewicz","year":"1979","journal-title":"Information Processing Letters"},{"key":"10.1016\/0164-1212(87)90041-0_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling Subject to Resource Constraints: Classification and Complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discrete Applied Mathematics"},{"article-title":"Scheduling Unit Time Independent Tasks on Dedicated Resource Systems","year":"1976","author":"Bonuccelli","key":"10.1016\/0164-1212(87)90041-0_BIB4"},{"key":"10.1016\/0164-1212(87)90041-0_BIB5","doi-asserted-by":"crossref","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."},{"key":"10.1016\/0164-1212(87)90041-0_BIB6","doi-asserted-by":"crossref","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 of Discrete Mathematics"},{"key":"10.1016\/0164-1212(87)90041-0_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1980.234465","article-title":"Guaranteed Response Time in a Hard Real-Time Environment","volume":"SE-6","author":"Leinbaugh","year":"1980","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0164-1212(87)90041-0_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of Machine Scheduling Problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/0164-1212(87)90041-0_BIB9","doi-asserted-by":"crossref","DOI":"10.1109\/MS.1984.234713","article-title":"Dynamic Task Scheduling in Distributed Hard Real-Time Systems","volume":"1","author":"Ramamritham","year":"1984","journal-title":"IEEE Software"},{"key":"10.1016\/0164-1212(87)90041-0_BIB10","article-title":"Solving Resource-Constrained Network Problems by Implicit Enumeration\u2014Non-preemptive Case","volume":"10","author":"Schrage","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/0164-1212(87)90041-0_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1985.6312211","article-title":"Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-time Systems","volume":"C-34","author":"Stankovic","year":"1985","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/0164-1212(87)90041-0_BIB12","series-title":"Computer and Job\/Shop Scheduling Theory","article-title":"Complexity of Sequence Problems","author":"Ullman","year":"1976"},{"key":"10.1016\/0164-1212(87)90041-0_BIB13","article-title":"Scheduling Tasks with Resource Requirements in Hard Real-Time Systems","volume":"SE-13","author":"Zhao","year":"1987","journal-title":"IEEE Transactions on Software Engineering"},{"article-title":"A Heuristic Approach to Scheduling Hard Real-Time Tasks with Resource Requirements in Distributed Systems","year":"1986","author":"Zhao","key":"10.1016\/0164-1212(87)90041-0_BIB14"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121287900410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121287900410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:55:51Z","timestamp":1552618551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0164121287900410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0164121287900410"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(87)90041-0","relation":{},"ISSN":["0164-1212"],"issn-type":[{"type":"print","value":"0164-1212"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}