{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:33:51Z","timestamp":1743114831830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030499877"},{"type":"electronic","value":"9783030499884"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49988-4_18","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"265-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3369-9650","authenticated-orcid":false,"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":[[2020,6,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","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":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-44914-2_21","volume-title":"Discrete Optimization and Operations Research","author":"A Ageev","year":"2016","unstructured":"Ageev, A., Ivanov, M.: Approximating coupled-task scheduling problems with equal exact delays. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 259\u2013271. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_21"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/11970125_1"},{"key":"18_CR4","doi-asserted-by":"publisher","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."},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00186-014-0469-6","volume":"80","author":"J B\u00e9k\u00e9si","year":"2014","unstructured":"B\u00e9k\u00e9si, 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(1), 47\u201381 (2014). https:\/\/doi.org\/10.1007\/s00186-014-0469-6","journal-title":"Math. Methods Oper. Res."},{"key":"18_CR6","doi-asserted-by":"publisher","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 - Operations Research - Recherche Operationnelle 46, 335\u2013353 (2012)","journal-title":"RAIRO - Operations Research - Recherche Operationnelle"},{"key":"18_CR7","doi-asserted-by":"publisher","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":"18_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1049\/ip-f-1.1980.0046","volume":"127","author":"A Farina","year":"1980","unstructured":"Farina, A., Neri, P.: Multitarget interleaved tracking for phased array radar. IEEE Proc. Part F Comm. Radar Signal Process. 127, 312\u2013318 (1980)","journal-title":"IEEE Proc. Part F Comm. Radar Signal Process."},{"key":"18_CR9","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":"18_CR10","doi-asserted-by":"publisher","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":"18_CR11","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":"18_CR12","doi-asserted-by":"crossref","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. Discrete Math. 5, 287\u2013326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"18_CR13","doi-asserted-by":"publisher","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. Ind. Eng. 60, 690\u2013698 (2011)","journal-title":"J. Comput. Ind. Eng."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D.: Sequencing and scheduling: algorithms and complexity, In: Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, 4, North Holland, Amsterdam, pp. 445\u2013522 (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"18_CR15","doi-asserted-by":"publisher","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":"18_CR16","doi-asserted-by":"publisher","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","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T16:54:48Z","timestamp":1723136088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}