{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:53:43Z","timestamp":1772553223817,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10951-020-00675-2","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T21:02:32Z","timestamp":1611262952000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Coupled task scheduling with time-dependent processing times"],"prefix":"10.1007","volume":"24","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":[[2021,1,21]]},"reference":[{"key":"675_CR1","first-page":"45","volume-title":"Inapproximately lower bounds for open shop problems with exact delays. Approximation and online algorithms","author":"AA Ageev","year":"2018","unstructured":"Ageev, A. A. (2018). Inapproximately lower bounds for open shop problems with exact delays. Approximation and online algorithms (pp. 45\u201355). New York: Springer."},{"issue":"4","key":"675_CR2","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. (2007). Approximation algorithms for UET scheduling problems with exact delays. Operations Research Letters, 35(4), 533\u2013540.","journal-title":"Operations Research Letters"},{"key":"675_CR3","volume-title":"Approximation algorithms for scheduling problems with exact delays. Approximation and online algorithms","author":"AA Ageev","year":"2007","unstructured":"Ageev, A. A., & Kononov, A. V. (2007). Approximation algorithms for scheduling problems with exact delays. Approximation and online algorithms. Berlin: Springer."},{"issue":"2","key":"675_CR4","doi-asserted-by":"publisher","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. Mathematical Methods of Operations Research, 59(2), 193\u2013203.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"2","key":"675_CR5","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, M. H., Torabzadeh, S., & Baghersad, M. (2014). Scheduling prioritized patients in emergency department laboratories. Computer Methods and Programs in Biomedicine, 117(2), 61\u201370.","journal-title":"Computer Methods and Programs in Biomedicine"},{"issue":"5","key":"675_CR6","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. (2010). A note on scheduling identical coupled tasks in logarithmic time. Discrete Applied Mathematics, 158(5), 583\u2013587.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"675_CR7","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. (2014). A branch-and-bound algorithm for the coupled task problem. Mathematical Methods of Operations Research, 80(1), 47\u201381.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"675_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10951-018-0581-1","volume":"22","author":"S Bessy","year":"2019","unstructured":"Bessy, S., & Giroudeau, R. (2019). Parameterized complexity of a coupled-task scheduling problem. Journal of Scheduling, 22(3), 305\u2013313.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"675_CR9","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-010-0167-z","volume":"13","author":"J Blazewicz","year":"2010","unstructured":"Blazewicz, J., Ecker, K., Kis, T., Potts, C. N., Tanas, M., & Whitehead, J. (2010). Scheduling of coupled tasks with unit processing times. Journal of Scheduling, 13(5), 453\u2013461.","journal-title":"Journal of Scheduling"},{"key":"675_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1\u201313.","journal-title":"European Journal of Operational Research"},{"issue":"16","key":"675_CR11","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 Applied Mathematics, 160(16), 2370\u20132388.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"675_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.orhc.2014.02.002","volume":"3","author":"A Condotta","year":"2014","unstructured":"Condotta, A., & Shakhlevich, N. (2014). Scheduling patient appointments via multilevel template: a case study in chemotherapy. Operations Research for Health Care, 3(3), 129\u2013144.","journal-title":"Operations Research for Health Care"},{"key":"675_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. New York: Springer."},{"key":"675_CR14","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, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"675_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JND Gupta","year":"1988","unstructured":"Gupta, J. N. D., & Gupta, S. K. (1988). Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering, 14(4), 387\u2013393.","journal-title":"Computers and Industrial Engineering"},{"key":"675_CR16","unstructured":"Gurobi Optimization, L. (2018). Gurobi Optimizer Reference Manual."},{"issue":"4","key":"675_CR17","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. (2011). Coupled-task scheduling on a single machine subject to a fixed-job-sequence. Computers and Industrial Engineering, 60(4), 690\u2013698.","journal-title":"Computers and Industrial Engineering"},{"key":"675_CR18","unstructured":"Khatami, M. and Salehipour, A. (2020). A binary search algorithm for the general coupled task scheduling problem. 4OR, 1\u201319."},{"issue":"1","key":"675_CR19","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. C. E. (2020). Coupled task scheduling with exact delays: literature review and models. European Journal of Operational Research, 282(1), 19\u201339.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"675_CR20","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","volume":"47","author":"AS Kunnathur","year":"1990","unstructured":"Kunnathur, A. S., & Gupta, S. K. (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research, 47(1), 56\u201364.","journal-title":"European Journal of Operational Research"},{"key":"675_CR21","unstructured":"Legrain, A., Fortin, M.-A., Lahrichi, N., Rousseau, L.-M., & Widmer, M. (2015). Stochastic optimization of the scheduling of a radiotherapy center. Journal of Physics: Conference Series. Vol. 616. 1. IOP Publishing, 012008."},{"issue":"6","key":"675_CR22","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. Journal of Scheduling, 18(6), 631\u2013644.","journal-title":"Journal of Scheduling"},{"issue":"02","key":"675_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129054107004711","volume":"18","author":"JY-T Leung","year":"2007","unstructured":"Leung, J. Y.-T., Li, H., & Zhao, H. (2007). Scheduling two-machine flow shops with exact delays. International Journal of Foundations of Computer Science, 18(02), 341\u2013359.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"675_CR24","doi-asserted-by":"crossref","unstructured":"Li, H., & Zhao, H. (2007). Scheduling Coupled-Tasks on a Single Machine. IEEE Symposium on Computational Intelligence in Scheduling, 137\u2013142.","DOI":"10.1109\/SCIS.2007.367681"},{"issue":"1","key":"675_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10878-017-0232-z","volume":"37","author":"Z Liu","year":"2019","unstructured":"Liu, Z., Lu, J., Liu, Z., Liao, G., Zhang, H. H., & Dong, J. (2019). Patient scheduling in hemodialysis service. Journal of Combinatorial Optimization, 37(1), 337\u2013362.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"675_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0933-3657(00)00061-0","volume":"20","author":"CC Marinagi","year":"2000","unstructured":"Marinagi, C. C., Spyropoulos, C. D., Papatheodorou, C., & Kokkotos, S. (2000). Continual planning and scheduling for managing patient tests in hospital laboratories. Artificial Intelligence in Medicine, 20(2), 139\u2013154.","journal-title":"Artificial Intelligence in Medicine"},{"issue":"6","key":"675_CR27","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers and Operations Re-search, 21(6), 653\u2013659.","journal-title":"Computers and Operations Re-search"},{"issue":"1","key":"675_CR28","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 Applied Mathematics, 72(1), 141\u2013154.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"675_CR29","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, C. O., Bailey, C., & McCormack, P. (2013). Stochastic online appointment scheduling of multi-step sequential procedures in nuclear medicine. Health Care Management Science, 16(4), 281\u2013299.","journal-title":"Health Care Management Science"},{"issue":"3","key":"675_CR30","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, W. E., Bailey, C., & McCormack, P. (2011). Patient and resource scheduling of multi-step medical procedures in nuclear medicine. IIE Transactions on Healthcare Systems Engineering, 1(3), 168\u2013184.","journal-title":"IIE Transactions on Healthcare Systems Engineering"},{"issue":"3","key":"675_CR31","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/nav.3800270312","volume":"27","author":"RD Shapiro","year":"1980","unstructured":"Shapiro, R. D. (1980). Scheduling coupled tasks. Naval Research Logistics Quarterly, 27(3), 489\u2013498.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"675_CR32","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. (2005). Interleaving two-phased jobs on a single machine. Discrete Optimization, 2(4), 348\u2013361.","journal-title":"Discrete Optimization"},{"issue":"5","key":"675_CR33","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. (2011). Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. Journal of Scheduling, 14(5), 501\u2013509.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"675_CR34","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing make span in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333\u2013348.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00675-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-020-00675-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00675-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T17:11:31Z","timestamp":1617815491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-020-00675-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["675"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00675-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,21]]},"assertion":[{"value":"21 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}