{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:43:54Z","timestamp":1777416234258,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,3,4]],"date-time":"2010-03-04T00:00:00Z","timestamp":1267660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10951-010-0167-z","type":"journal-article","created":{"date-parts":[[2010,3,3]],"date-time":"2010-03-03T21:00:10Z","timestamp":1267650010000},"page":"453-461","source":"Crossref","is-referenced-by-count":20,"title":["Scheduling of coupled tasks with unit processing times"],"prefix":"10.1007","volume":"13","author":[{"given":"J.","family":"Blazewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Tanas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Whitehead","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,4]]},"reference":[{"issue":"4","key":"167_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.orl.2006.09.006","volume":"35","author":"A. A. Ageev","year":"2007","unstructured":"Ageev, A. A., & Baburin, A. E. (2007). Approximation algorithms for uet scheduling problems with exact delays. Operation Research Letters, 35(4), 533\u2013540.","journal-title":"Operation Research Letters"},{"issue":"2","key":"167_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s001860300328","volume":"59","author":"D. Ahr","year":"2004","unstructured":"Ahr, D., Bekesi, J., Galambos, G., & Oswald, M.G.R. (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"},{"key":"167_CR3","volume-title":"Introduction to sequencing and scheduling","author":"K. Baker","year":"1974","unstructured":"Baker, K. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"issue":"2","key":"167_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.orl.2008.11.002","volume":"37","author":"J. B\u00e9k\u00e9si","year":"2009","unstructured":"B\u00e9k\u00e9si, J., Galambos, G., Oswald, M., & Reinelt, G. (2009). Improved analysis of an algorithm for the coupled task problem with uet jobs. Operation Research Letters, 37(2), 93\u201396.","journal-title":"Operation Research Letters"},{"key":"167_CR5","volume-title":"Handbook of scheduling. From theory to applications","author":"J. Blazewicz","year":"2007","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook of scheduling. From theory to applications. New York: Springer."},{"issue":"2","key":"167_CR6","doi-asserted-by":"crossref","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. Computers and Operations Research, 36(2), 301\u2013307.","journal-title":"Computers and Operations Research"},{"key":"167_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P. (2001). Scheduling algorithms (3rd ed.). Berlin: Springer.","edition":"3"},{"key":"167_CR8","first-page":"299","volume":"202","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., & Knust, S. (1998). Complexity results for single-machine problems with positive finish-start time-lags. Mathematik, Reihe P, 202, 299\u2013316.","journal-title":"Mathematik, Reihe P"},{"key":"167_CR9","unstructured":"Gupta, J. N. D. (1994). Single facility scheduling with two operations per job and time-lags (Preprint)."},{"key":"167_CR10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T. C. Hu","year":"1961","unstructured":"Hu, T. C. (1961). Parallel sequencing and assembly line problems. Operational Research, 9, 841\u2013848.","journal-title":"Operational Research"},{"key":"167_CR11","unstructured":"Lehoux-Lebacque, V., Brauner, N., & Finke, G. (2009). Identical coupled tasks scheduling: polynomial complexity of the cyclic case. Les cahiers Leibnitz, 179."},{"key":"167_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling","author":"J. Leung","year":"2004","unstructured":"Leung, J. (2004). Handbook of scheduling. London: Chapman & Hall."},{"key":"167_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/SCIS.2007.367681","volume":"1\u20135","author":"H. Li","year":"2007","unstructured":"Li, H., & Zhao, H. (2007). Scheduling coupled tasks on a single machine. IEEE Symposium on Computational Intelligence in Scheduling, 1\u20135, 137\u2013142.","journal-title":"IEEE Symposium on Computational Intelligence in Scheduling"},{"key":"167_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"A. J. Orman","year":"1997","unstructured":"Orman, A. J., & Potts, C. N. (1997). On the complexity of coupled tasks scheduling. Discrete Applied Mathematics, 72, 141\u2013154.","journal-title":"Discrete Applied Mathematics"},{"key":"167_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0377-2217(95)00307-X","volume":"90","author":"A. J. Orman","year":"1996","unstructured":"Orman, A. J., Potts, C. N., Shahani, A. K., & Moore, A. R. (1996). Scheduling for the control of a multifunctional radar system. European Journal of Operational Research, 90, 13\u201325.","journal-title":"European Journal of Operational Research"},{"key":"167_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0305-0548(97)00047-6","volume":"25","author":"A. J. Orman","year":"1998","unstructured":"Orman, A. J., Shahani, A. K., & Moore, A. R. (1998). Modelling for the control of a complex radar system. Computers and Operations Research, 25, 239\u2013249.","journal-title":"Computers and Operations Research"},{"issue":"10","key":"167_CR17","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1057\/palgrave.jors.2602272","volume":"58","author":"C. N. Potts","year":"2007","unstructured":"Potts, C. N., & Whitehead, J. D. (2007). Heuristics for a coupled-operation scheduling problem. Journal of the Operational Research Society, 58(10), 1375\u20131388.","journal-title":"Journal of the Operational Research Society"},{"key":"167_CR18","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/nav.3800270312","volume":"27","author":"R. D. Shapiro","year":"1980","unstructured":"Shapiro, R. D. (1980). Scheduling coupled tasks. Naval Research Logistics Quarterly, 27, 477\u2013481.","journal-title":"Naval Research Logistics Quarterly"},{"key":"167_CR19","first-page":"155","volume-title":"Computer and job-shop scheduling theory","author":"J. D. Ullman","year":"1976","unstructured":"Ullman, J. D. (1976). In E. G. Coffman et al. (Eds.), Computer and job-shop scheduling theory (pp. 155\u2013159). New York: Wiley."},{"key":"167_CR20","unstructured":"Whitehead, J. (2002). Ph.D. thesis, University of Southampton."},{"key":"167_CR21","unstructured":"Yu, W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. Technische Universiteit Eindhoven."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0167-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0167-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0167-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T09:04:43Z","timestamp":1635066283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0167-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,4]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0167-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,4]]}}}