{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:15:42Z","timestamp":1768526142911,"version":"3.49.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":[[1991,7]]},"DOI":"10.1016\/0167-6377(91)90014-g","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"281-284","source":"Crossref","is-referenced-by-count":72,"title":["Permutation vs. non-permutation flow shop schedules"],"prefix":"10.1016","volume":"10","author":[{"given":"Chris N.","family":"Potts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90014-G_BIB1","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u00f6s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/0167-6377(91)90014-G_BIB2","series-title":"Technical Report BS-R8909","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0167-6377(91)90014-G_BIB3","series-title":"Technical Report Bericht 82-11, Fachbereich 20 Mathematik","article-title":"Machine aggregation heuristics in shop scheduling","author":"R\u00f6ck","year":"1982"},{"key":"10.1016\/0167-6377(91)90014-G_BIB4","first-page":"303","article-title":"Machine aggregation heuristics in shop-scheduling","volume":"45","author":"R\u00f6ck","year":"1983","journal-title":"Methods Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190014G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190014G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:27:02Z","timestamp":1552886822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190014G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["016763779190014G"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90014-g","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}