{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:23Z","timestamp":1759847663969},"reference-count":18,"publisher":"EDP Sciences","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1051\/ro\/2016034","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T06:36:35Z","timestamp":1462862195000},"page":"781-795","source":"Crossref","is-referenced-by-count":3,"title":["Some complexity and approximation results for coupled-tasks scheduling problem according to topology"],"prefix":"10.1051","volume":"50","author":[{"given":"Benoit","family":"Darties","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Simonin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"key":"R1","first-page":"193","volume":"59","author":"Ahr","year":"2004"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"J. Bla\u017cewicz, K. Ecker, T. Kis, C.N. Potts, M. Tanas and J. Whitehead, Scheduling of coupled tasks with unit processing times. Technical report, Poznan University of Technology (2009).","DOI":"10.1007\/s10951-010-0167-z"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Caprara, H. Kellerer and U. Pferschy, A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. (2000).","DOI":"10.1016\/S0020-0190(00)00010-7"},{"key":"R4","first-page":"308","volume":"11","author":"Caprara","year":"2000"},{"key":"R5","first-page":"99","volume":"9","author":"Caprara","year":"2003"},{"key":"R6","first-page":"171","volume":"4","author":"Dawande","year":"2000"},{"key":"R7","first-page":"125","volume":"69","author":"Edmonds","year":"1965"},{"key":"R8","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman & Co., New York, NY, USA (1979)."},{"key":"R9","first-page":"107","volume":"401","author":"Giroudeau","year":"2008"},{"key":"R10","first-page":"287","volume":"5","author":"Graham","year":"1979"},{"key":"R11","first-page":"463","volume":"22","author":"Ibarra","year":"1975"},{"key":"R12","first-page":"349","volume":"66","author":"Kellerer","year":"2003"},{"key":"R13","first-page":"83","volume":"2","author":"Kuhn","year":"1955"},{"key":"R14","first-page":"141","volume":"72","author":"Orman","year":"1997"},{"key":"R15","first-page":"477","volume":"27","author":"Shapiro","year":"1980"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"G. Simonin, R. Giroudeau and J.-C. K\u00f6nig, Complexity and approximation for scheduling problem for coupled-tasks in presence of compatibility tasks. In Project Management and Scheduling (2010).","DOI":"10.1016\/j.endm.2010.05.082"},{"key":"R17","first-page":"501","volume":"14","author":"Simonin","year":"2011"},{"key":"R18","first-page":"1","volume":"7","author":"Simonin","year":"2012"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016034\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T13:16:06Z","timestamp":1567862166000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":18,"journal-issue":{"issue":"4-5"},"alternative-id":["ro151132"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2016034","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}