{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:26:07Z","timestamp":1648920367863},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90171-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"361-366","source":"Crossref","is-referenced-by-count":4,"title":["The cyclic compact open-shop scheduling problem"],"prefix":"10.1016","volume":"111","author":[{"given":"N.V.R.","family":"Mahadev","sequence":"first","affiliation":[]},{"given":"Ph.","family":"Solot","sequence":"additional","affiliation":[]},{"given":"D.","family":"de Werra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90171-O_BIB1","series-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/0012-365X(93)90171-O_BIB2","series-title":"Scheduling under Resource Constraints: Deterministic Models","author":"Blazewicz","year":"1986"},{"key":"10.1016\/0012-365X(93)90171-O_BIB3","first-page":"1","article-title":"On cyclic sequence type for constructing cyclic schedules","volume":"29","author":"Dauscha","year":"1985","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0012-365X(93)90171-O_BIB4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasaraty","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90171-O_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","article-title":"On the flowshop sequencing problem with no wait in process","volume":"23","author":"Reddi","year":"1972","journal-title":"Oper. Res. Quart."},{"key":"10.1016\/0012-365X(93)90171-O_BIB6","unstructured":"D. de Werra, N.V.R. Mahadev and Ph. Solot, Periodic compact scheduling to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390171O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390171O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:45Z","timestamp":1555134705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390171O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390171O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90171-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}