{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T13:12:26Z","timestamp":1779369146167,"version":"3.53.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T00:00:00Z","timestamp":1398470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00186-014-0469-6","type":"journal-article","created":{"date-parts":[[2014,4,25]],"date-time":"2014-04-25T09:21:20Z","timestamp":1398417680000},"page":"47-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A branch-and-bound algorithm for the coupled task problem"],"prefix":"10.1007","volume":"80","author":[{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael N.","family":"Jung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Oswald","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,26]]},"reference":[{"key":"469_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.orl.2006.09.006","volume":"25","author":"AA Ageev","year":"2007","unstructured":"Ageev AA, Baburin AE (2007) Approximation algorithms for UET scheduling problems with exact delays. Oper Res Lett 25:533\u2013540","journal-title":"Oper Res Lett"},{"key":"469_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s001860300328","volume":"59","author":"D Ahr","year":"2004","unstructured":"Ahr D, B\u00e9k\u00e9si J, Galambos G, Oswald M, Reinelt G (2004) An exact algorithm for scheduling identical coupled tasks. Math Methods Oper Res 59:193\u2013203","journal-title":"Math Methods Oper Res"},{"key":"469_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1590\/S0104-65002001000200004","volume":"7","author":"J Blazewicz","year":"2001","unstructured":"Blazewicz J, Ecker K, Kis T, Tanas M (2001) A note on the complexity of scheduling coupled tasks on a single processor. J Brazilian Comput Soc 7:23\u201326","journal-title":"J Brazilian Comput Soc"},{"issue":"1","key":"469_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/nav.10103","volume":"51","author":"M Elshafei","year":"2004","unstructured":"Elshafei M, Sherali HD, Smith JC (2004) Radar pulse interleaving for multi-target tracking. Nav Res Logist 51(1):72\u201394","journal-title":"Nav Res Logist"},{"key":"469_CR5","doi-asserted-by":"crossref","unstructured":"Li H, Zhao H (2007) Scheduling coupled-tasks on a single machine. In: IEEE symposium on computational intelligence in scheduling SCIS \u201907, pp 137\u2013142","DOI":"10.1109\/SCIS.2007.367681"},{"key":"469_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"AJ Orman","year":"1997","unstructured":"Orman AJ, Potts CN (1997) On the complexity of coupled-task scheduling. Discret Appl Math 72:141\u2013154","journal-title":"Discret Appl Math"},{"key":"469_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0377-2217(95)00307-X","volume":"90","author":"AJ Orman","year":"1996","unstructured":"Orman AJ, Potts CN, Shahani AK, Moore AR (1996) Scheduling for a multifunction phased array radar system. Eur J Oper Res 90:13\u201325","journal-title":"Eur J Oper Res"},{"key":"469_CR8","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1057\/palgrave.jors.2602272","volume":"58","author":"CN Potts","year":"2007","unstructured":"Potts CN, Whitehead JD (2007) Heuristics for a coupled-operation scheduling problem. J Oper Res Soc 58:1375\u20131388","journal-title":"J Oper Res Soc"},{"key":"469_CR9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.disopt.2005.08.002","volume":"2","author":"HD Sherali","year":"2005","unstructured":"Sherali HD, Smith JC (2005) Interleaving two-phased jobs on a single machine with application to radar pulse interleaving. Discret Optim 2:348\u2013361","journal-title":"Discret Optim"},{"key":"469_CR10","unstructured":"Tanas M, Blazewicz J, Ecker K (2007) Polynomial time algorithm for coupled tasks scheduling problem. In: Blazewicz J, Ecker K, Hammer B (eds) ICOLE 2007. Lessach, Austria. Report IfI-07-03, TU Clausthal, pp 76\u201369"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0469-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-014-0469-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0469-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T22:00:04Z","timestamp":1565388004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-014-0469-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,26]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s00186-014-0469-6","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,26]]}}}