{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T16:20:05Z","timestamp":1773850805339,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0167-6377(95)00058-5","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T16:10:05Z","timestamp":1063383005000},"page":"223-232","source":"Crossref","is-referenced-by-count":36,"title":["Ordinal algorithms for parallel machine scheduling"],"prefix":"10.1016","volume":"18","author":[{"given":"Wei-Ping","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Sidney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Vliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00058-5_BIB1","article-title":"No-wait flow shop scheduling with large lot size","author":"Agnetis","year":"1989"},{"key":"10.1016\/0167-6377(95)00058-5_BIB2","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0167-6377(95)00058-5_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-6377(95)00058-5_BIB4","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0167-6377(95)00058-5_BIB5","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0167-6377(95)00058-5_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(96)00002-8","article-title":"Bin packing using semi-ordinal data","volume":"19","author":"Liu","year":"1996","journal-title":"Operations Research Letters"},{"key":"10.1016\/0167-6377(95)00058-5_BIB7","doi-asserted-by":"crossref","unstructured":"W.-P. Liu and J.B. Sidney, \u201cOrdinal algorithms for packing with target center of gravity\u201d, Order, to appear.","DOI":"10.1007\/BF00383965"},{"key":"10.1016\/0167-6377(95)00058-5_BIB8","series-title":"Working Paper 95-57","article-title":"Ordinal algorithms for parallel machine scheduling","author":"Liu","year":"1995"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:56:38Z","timestamp":1551005798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637795000585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167637795000585"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00058-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}