{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:44:35Z","timestamp":1756385075650},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0167-8191(98)00100-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"23-40","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling series\u2013parallel orders subject to 0\/1-communication delays"],"prefix":"10.1016","volume":"25","author":[{"given":"Rolf H.","family":"M\u00f6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus W.","family":"Sch\u00e4ffter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00100-8_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","article-title":"A polynomial time algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints","volume":"43","author":"Chr\u00e9tienne","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-8191(98)00100-8_BIB2","unstructured":"P. Chr\u00e9tienne, C. Picouleau, Scheduling with communication delays: A survey, in: P. Chretienne, E.G. Coffman, J.K. Lenstra (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995, pp. 65\u201390"},{"issue":"2","key":"10.1016\/S0167-8191(98)00100-8_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","article-title":"Scheduling UET\u2013UCT series\u2013parallel graphs on two processors","volume":"162","author":"Finta","year":"1996","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"10.1016\/S0167-8191(98)00100-8_BIB4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. on Comput."},{"key":"10.1016\/S0167-8191(98)00100-8_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","article-title":"Three, four, five, six, or the complexity of scheduling with communication delays","volume":"16","author":"Hoogeveen","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-8191(98)00100-8_BIB6","doi-asserted-by":"crossref","unstructured":"C. Hanen, A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, IEEE Symposium on Emerging Technologies and Factory Automation, september 1995","DOI":"10.1109\/ETFA.1995.496773"},{"key":"10.1016\/S0167-8191(98)00100-8_BIB7","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, M. Sch\u00e4ffter, A.S. Schulz, Scheduling jobs with communication delays: using infeasible solutions for approximation, Algorithms \u2014 ESA'96, Fourth Annual European Symposium, Springer-Verlag, Lecture Notes in Computer Science, vol. 1136, 1996, pp. 76\u201390","DOI":"10.1007\/3-540-61680-2_48"},{"key":"10.1016\/S0167-8191(98)00100-8_BIB8","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, Computationally tractable classes of ordered sets, in: I. Rival (Ed.), Algorithms and Order, Nato Advanced Study Institutes Series, Reidel, Dordrecht, 1989, pp. 105\u2013193","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"10.1016\/S0167-8191(98)00100-8_BIB9","unstructured":"R.H. M\u00f6hring, M.W. Sch\u00e4ffter, A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays, Preprint No.506\/1995, Department of Mathematics, University of Technology, Berlin, Germany, 1995"},{"key":"10.1016\/S0167-8191(98)00100-8_BIB10","doi-asserted-by":"crossref","unstructured":"H. Hoogeveen, P. Schuurman, G.J. Woeginger, Non-approximability results for scheduling problems with minsum criteria, In R.E. Bixby, E.A. Boyd, and R.Z. R\u0131\u0301os-Mercado, editors, Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, pages 353\u2013366. Springer-Verlag, Lecture Notes in Computer Science, vol. 1412, 1998","DOI":"10.1007\/3-540-69346-7_27"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001008?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001008?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:22:15Z","timestamp":1555557735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198001008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0167819198001008"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00100-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}