{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:54Z","timestamp":1759667814868,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10288-020-00463-w","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T13:03:14Z","timestamp":1605877394000},"page":"593-611","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A binary search algorithm for the general coupled task scheduling problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Mostafa","family":"Khatami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4866-1396","authenticated-orcid":false,"given":"Amir","family":"Salehipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,20]]},"reference":[{"issue":"4","key":"463_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 AA, Baburin AE (2007) Approximation algorithms for UET scheduling problems with exact delays. Op Res Lett 35(4):533\u2013540","journal-title":"Op Res Lett"},{"issue":"2","key":"463_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cmpb.2014.08.006","volume":"117","author":"A Azadeh","year":"2014","unstructured":"Azadeh A, Farahani MH, Torabzadeh S, Baghersad M (2014) Scheduling prioritized patients in emergency department laboratories. Comput Methods Progr Biomed 117(2):61\u201370","journal-title":"Comput Methods Progr Biomed"},{"issue":"1","key":"463_CR3","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 MN, Oswald M, Reinelt G (2014) A branch-and-bound algorithm for the coupled task problem. Math Methods Op Res 80(1):47\u201381","journal-title":"Math Methods Op Res"},{"issue":"2","key":"463_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cor.2007.10.003","volume":"36","author":"N Brauner","year":"2009","unstructured":"Brauner N, Finke G, Lehoux-Lebacque V, Potts C, Whitehead J (2009) Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput Op Res 36(2):301\u2013307","journal-title":"Comput Op Res"},{"issue":"2","key":"463_CR5","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/S0377-2217(02)00763-4","volume":"149","author":"J Carlier","year":"2003","unstructured":"Carlier J, N\u00e9ron E (2003) On linear lower bounds for the resource constrained project scheduling problem. Eur J Op Res 149(2):314\u2013324","journal-title":"Eur J Op Res"},{"issue":"16","key":"463_CR6","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 (2012) Scheduling coupled-operation jobs with exact time-lags. Discrete Appl Math 160(16):2370\u20132388","journal-title":"Discrete Appl Math"},{"issue":"3","key":"463_CR7","first-page":"129","volume":"3","author":"A Condotta","year":"2014","unstructured":"Condotta A, Shakhlevich N (2014) Scheduling patient appointments via multilevel template: a case study in chemotherapy. Op Res Health Care 3(3):129\u2013144","journal-title":"Op Res Health Care"},{"issue":"3","key":"463_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk J, Mesnier MP, Mor\u00e9 JJ (1998) The NEOS server. IEEE J Comput Sci Eng 5(3):68\u201375","journal-title":"IEEE J Comput Sci Eng"},{"issue":"3","key":"463_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.29.3.267","volume":"29","author":"PM Fran\u00e7a","year":"1995","unstructured":"Fran\u00e7a PM, Gendreau M, Laporte G, M\u00fcller FM (1995) The m-traveling salesman problem with minmax objective. Transp Sci 29(3):267\u2013275","journal-title":"Transp Sci"},{"key":"463_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham R, Lawler E, Lenstra J, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"463_CR11","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/ijoc.2014.0625","volume":"27","author":"D Grimes","year":"2015","unstructured":"Grimes D, Hebrard E (2015) Solving variants of the job shop scheduling problem through con ictdirected search. INFORMS J Comput 27(2):268\u2013284","journal-title":"INFORMS J Comput"},{"key":"463_CR12","unstructured":"Gurobi Optimization L (2018) Gurobi Optimizer Reference Manual"},{"issue":"1","key":"463_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2019.08.045","volume":"282","author":"M Khatami","year":"2020","unstructured":"Khatami M, Salehipour A, Cheng T (2020) Coupled task scheduling with exact delays: literature review and models. Eur J Op Res 282(1):19\u201339","journal-title":"Eur J Op Res"},{"issue":"6","key":"463_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-015-0438-9","volume":"18","author":"V Lehoux-Lebacque","year":"2015","unstructured":"Lehoux-Lebacque V, Brauner N, Finke G (2015) Identical coupled task scheduling: polynomial complexity of the cyclic case. J Sched 18(6):631\u2013644","journal-title":"J Sched"},{"key":"463_CR15","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, pp 137\u2013142","DOI":"10.1109\/SCIS.2007.367681"},{"issue":"2","key":"463_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0933-3657(00)00061-0","volume":"20","author":"CC Marinagi","year":"2000","unstructured":"Marinagi CC, Spyropoulos CD, Papatheodorou C, Kokkotos S (2000) Continual planning and scheduling for managing patient tests in hospital laboratories. Artif Intel Med 20(2):139\u2013154","journal-title":"Artif Intel Med"},{"issue":"3","key":"463_CR17","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag Sci 45(3):414\u2013424","journal-title":"Manag Sci"},{"issue":"1","key":"463_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"A Orman","year":"1997","unstructured":"Orman A, Potts C (1997) On the complexity of coupled-task scheduling. Discrete Appl Math 72(1):141\u2013154","journal-title":"Discrete Appl Math"},{"issue":"3","key":"463_CR19","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1080\/19488300.2011.617718","volume":"1","author":"E P\u00e9rez","year":"2011","unstructured":"P\u00e9rez E, Ntaimo L, Wilhelm WE, Bailey C, McCormack P (2011) Patient and resource scheduling of multi-step medical procedures in nuclear medicine. IIE Trans Healthc Syst Eng 1(3):168\u2013184","journal-title":"IIE Trans Healthc Syst Eng"},{"issue":"4","key":"463_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10729-013-9224-4","volume":"16","author":"E P\u00e9rez","year":"2013","unstructured":"P\u00e9rez E, Ntaimo L, Malav\u00e9 CO, Bailey C, McCormack P (2013) Stochastic online appointment scheduling of multi-step sequential procedures in nuclear medicine. Health Care Manag Sci 16(4):281\u2013299","journal-title":"Health Care Manag Sci"},{"issue":"3","key":"463_CR21","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/nav.3800270312","volume":"27","author":"RD Shapiro","year":"1980","unstructured":"Shapiro RD (1980) Scheduling coupled tasks. Naval Res Logist Q 27(3):489\u2013498","journal-title":"Naval Res Logist Q"},{"issue":"4","key":"463_CR22","doi-asserted-by":"publisher","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. Discrete Optim 2(4):348\u2013361","journal-title":"Discrete Optim"},{"issue":"2","key":"463_CR23","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.cie.2011.01.015","volume":"61","author":"G Simonin","year":"2011","unstructured":"Simonin G, Giroudeau R, K\u00f6nig J-C (2011a) Complexity and approximation for scheduling problem for a torpedo. Comput Ind Eng 61(2):352\u2013356","journal-title":"Comput Ind Eng"},{"issue":"5","key":"463_CR24","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10951-010-0193-x","volume":"14","author":"G Simonin","year":"2011","unstructured":"Simonin G, Darties B, Giroudeau R, K\u00f6nig J-C (2011b) Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J Sched 14(5):501\u2013509","journal-title":"J Sched"},{"key":"463_CR25","unstructured":"Simonin G (2009) Limpact de Iintroduction du graphe de compatibilit dans les problmes dordonnancement en prsence de tches-couples. PhD thesis. Montpellier, France: Universite de Montpellier II"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00463-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-020-00463-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00463-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T10:11:27Z","timestamp":1637575887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-020-00463-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,20]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00463-w","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2020,11,20]]},"assertion":[{"value":"18 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}