{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T08:26:43Z","timestamp":1722155203479},"reference-count":0,"publisher":"Inderscience Publishers","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJMR"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1504\/ijmr.2020.108188","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T11:41:32Z","timestamp":1594122092000},"page":"199","source":"Crossref","is-referenced-by-count":4,"title":["Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability"],"prefix":"10.1504","volume":"15","author":[{"given":"Asmaa","family":"Khoudi","sequence":"first","affiliation":[]},{"given":"Ali","family":"Berrichi","sequence":"additional","affiliation":[]}],"member":"378","container-title":["International Journal of Manufacturing Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.inderscienceonline.com\/doi\/full\/10.1504\/IJMR.2020.108188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T11:41:32Z","timestamp":1594122092000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=108188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1504\/ijmr.2020.108188","relation":{},"ISSN":["1750-0591","1750-0605"],"issn-type":[{"value":"1750-0591","type":"print"},{"value":"1750-0605","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}
