{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:39:08Z","timestamp":1759667948250},"reference-count":0,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Systems Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1080\/002077200291118","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T15:43:05Z","timestamp":1027698185000},"page":"537-542","source":"Crossref","is-referenced-by-count":15,"title":["A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems"],"prefix":"10.1080","volume":"31","author":[{"given":"Tai-Yue","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuei-Bin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","container-title":["International Journal of Systems Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/002077200291118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T09:29:16Z","timestamp":1481707756000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/002077200291118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1080\/002077200291118"],"URL":"https:\/\/doi.org\/10.1080\/002077200291118","relation":{},"ISSN":["0020-7721","1464-5319"],"issn-type":[{"value":"0020-7721","type":"print"},{"value":"1464-5319","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}