{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:58:24Z","timestamp":1778903904363,"version":"3.51.4"},"reference-count":6,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260504391","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:19:50Z","timestamp":1486030790000},"page":"439-447","source":"Crossref","is-referenced-by-count":19,"title":["Open shop scheduling with delays"],"prefix":"10.1051","volume":"26","author":[{"given":"V. J.","family":"Rayward-Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Rebaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"GONZALEZ T. and SAHNI S., Open Shop Scheduling to Minimize Finish Time, J. A.C.M., 1976, 23, pp. 665-679.4290890343.68031","DOI":"10.1145\/321978.321985"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"HWANG J. J., CHOW Y. C., ANGERS F. D. and LEE C. Y., Scheduling Precedence Graphs in Systems with Interprocessor Communications Times, S.I.A.M. Comput, 1989, 18, pp. 244-257.9866640677.68026","DOI":"10.1137\/0218016"},{"key":"R3","unstructured":"KARP R. M., Reducibilities Among Combinational Problems in Complexity of Computer Computations, R. E. MILLER and J. W. THATCHER Eds., Plenum Press, New York, 1972.3784760366.68041"},{"key":"R4","unstructured":"LENSTRA J. K., Private Communication, cited in M. R. GAREY and D. S. JOHNSON Eds, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. FREEMAN, San Francisco, 1979.519066"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"RAYWARD-SMITH V. J., The complexity of Preemptive Scheduling Given Interprocessor Communication Delays, Inform. Proc. Letters, 1987 a, 25, pp. 123-125.896154","DOI":"10.1016\/0020-0190(87)90231-6"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"RAYWARD-SMITH V. J., UET Scheduling with Unit Inerprocessor Communication Delays, Discrete Appl. Math., 1987 b, 18, pp. 55-71.9051780634.90031","DOI":"10.1016\/0166-218X(87)90042-4"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260504391\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:02:18Z","timestamp":1568772138000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260504391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":6,"journal-issue":{"issue":"5"},"alternative-id":["ita1992260504391"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260504391","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}