{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:18:34Z","timestamp":1759133914461},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. High Speed Comp."],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1142\/s012905339500004x","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T11:59:25Z","timestamp":1100260765000},"page":"45-71","source":"Crossref","is-referenced-by-count":45,"title":["A TABU SEARCH APPROACH TO TASK SCHEDULING ON HETEROGENEOUS PROCESSORS UNDER PRECEDENCE CONSTRAINTS"],"prefix":"10.1142","volume":"07","author":[{"given":"STELLA C.S.","family":"PORTO","sequence":"first","affiliation":[]},{"given":"CELSO C.","family":"RIBEIRO","sequence":"additional","affiliation":[]}],"member":"219","container-title":["International Journal of High Speed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905339500004X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T04:39:08Z","timestamp":1480653548000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905339500004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":0,"journal-issue":{"issue":"01","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1142\/S012905339500004X"],"URL":"https:\/\/doi.org\/10.1142\/s012905339500004x","relation":{},"ISSN":["0129-0533"],"issn-type":[{"value":"0129-0533","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}