{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:04:04Z","timestamp":1725872644039},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449135"},{"type":"electronic","value":"9783319449142"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44914-2_21","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T16:56:02Z","timestamp":1480438562000},"page":"259-271","source":"Crossref","is-referenced-by-count":5,"title":["Approximating Coupled-Task Scheduling Problems with Equal Exact Delays"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Ageev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.orl.2006.09.006","volume":"35","author":"AA Ageev","year":"2007","unstructured":"Ageev, A.A., Baburin, A.E.: Approximation algorithms for UET scheduling problems with Exact Delays. Oper. Res. Lett. 35, 533\u2013540 (2007)","journal-title":"Oper. Res. Lett."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11970125_1","volume-title":"Approximation and Online Algorithms","author":"AA Ageev","year":"2007","unstructured":"Ageev, A.A., Kononov, A.V.: Approximation algorithms for scheduling problems with exact delays. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 1\u201314. Springer, Heidelberg (2007)"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.dam.2009.10.012","volume":"158","author":"P Baptiste","year":"2010","unstructured":"Baptiste, P.: A note on scheduling identical coupled tasks in logarithmic time. Disc. Appl. Math. 158, 583\u2013587 (2010)","journal-title":"Disc. Appl. Math."},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00186-014-0469-6","volume":"80","author":"J Bekesi","year":"2014","unstructured":"Bekesi, J., Galambos, G., Jung, M.N., Oswald, M., Reinelt, G.: A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80, 47\u201381 (2014)","journal-title":"Math. Methods Oper. Res."},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1051\/ro\/2012020","volume":"46","author":"J Blazewicz","year":"2012","unstructured":"Blazewicz, J., Pawlak, G., Tanas, M., Wojciechowicz, W.: New algorithms for coupled tasks scheduling \u2013 a survey. RAIRO - Oper. Res. - Recherche Operationnelle 46, 335\u2013353 (2012)","journal-title":"RAIRO - Oper. Res. - Recherche Operationnelle"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"2370","DOI":"10.1016\/j.dam.2012.05.026","volume":"160","author":"A Condotta","year":"2012","unstructured":"Condotta, A., Shakhlevich, N.V.: Scheduling coupled-operation jobs with exact time-lags. Discrete Appl. Math. 160, 2370\u20132388 (2012)","journal-title":"Discrete Appl. Math."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Farina, A., Neri, P.: Multitarget interleaved tracking for phased array radar. IEEE Proc. Part F: Comm. Radar Signal Process. 127, 312\u2013318 (1980)","DOI":"10.1049\/ip-f-1.1980.0046"},{"key":"21_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.10103","volume":"51","author":"M Elshafei","year":"2004","unstructured":"Elshafei, M., Sherali, H.D., Smith, J.C.: Radar pulse interleaving for multi-target tracking. Naval Res. Logist. 51, 79\u201394 (2004)","journal-title":"Naval Res. Logist."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Izquierdo-Fuente, A., Casar-Corredera, J.R.: Optimal radar pulse scheduling using neural networks. In: IEEE International Conference on Neural Networks, vol. 7, pp. 4588\u20134591 (1994)","DOI":"10.1109\/ICNN.1994.375014"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.cie.2011.01.002","volume":"60","author":"FJ Hwang","year":"2011","unstructured":"Hwang, F.J., Lin, B.M.T.: Coupled-task scheduling on a single machine subject to a fixed-job-sequence. J. Comput. Indust. Eng. 60, 690\u2013698 (2011)","journal-title":"J. Comput. Indust. Eng."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"AJ Orman","year":"1997","unstructured":"Orman, A.J., Potts, C.N.: On the complexity of coupled-task scheduling. Discrete Appl. Math. 72, 141\u2013154 (1997)","journal-title":"Discrete Appl. Math."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.disopt.2005.08.002","volume":"2","author":"HD Sherali","year":"2005","unstructured":"Sherali, H.D., Smith, J.C.: Interleaving two-phased jobs on a single machine. Discrete Optim. 2, 348\u2013361 (2005)","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Discrete Optimization and Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44914-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:47:45Z","timestamp":1498351665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}