{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:25Z","timestamp":1759847725318,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10951-022-00769-z","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T17:05:51Z","timestamp":1670259951000},"page":"331-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of open shop scheduling with time lags"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3181-3042","authenticated-orcid":false,"given":"Wies\u0142aw","family":"Kubiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"key":"769_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/B:ANOR.0000030683.64615.c8","volume":"129","author":"P Brucker","year":"2004","unstructured":"Brucker, P., Knust, S., Cheng, T. C. E., & Shakhlevich, N. V. (2004). Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research, 129, 81\u2013106.","journal-title":"Annals of Operations Research"},{"key":"769_CR2","doi-asserted-by":"publisher","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. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"769_CR3","doi-asserted-by":"publisher","unstructured":"Kubiak, W. (2022). A note on scheduling coupled tasks for minimum total completion time. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-022-04706-3","DOI":"10.1007\/s10479-022-04706-3"},{"key":"769_CR4","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1057\/palgrave.jors.2600769","volume":"50","author":"D Rebaine","year":"1999","unstructured":"Rebaine, D., & Strusevich, V. A. (1999). Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society, 50, 756\u2013764.","journal-title":"Journal of the Operational Research Society"},{"key":"769_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0166-218X(99)00115-8","volume":"93","author":"VA Strusevich","year":"1999","unstructured":"Strusevich, V. A. (1999). A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Applied Mathematics, 93, 287\u2013304.","journal-title":"Discrete Applied Mathematics"},{"key":"769_CR6","unstructured":"Yu, W. (1996).The two-machine flow shop problem with delays and the one- machine total tardiness problem. Ph.D. thesis, Eindhoven University of Technology."},{"key":"769_CR7","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, J. A., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard. Journal of Scheduling, 7, 333\u2013348.","journal-title":"Journal of Scheduling"},{"key":"769_CR8","unstructured":"Zhang, X. (2010). Scheduling with time lags. Ph.D. thesis, Erasmus Universiteit Rotterdam."},{"key":"769_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2009.09.023","volume":"204","author":"X Zhang","year":"2010","unstructured":"Zhang, X., & van de Velde, S. (2010). On-line two-machine open shop scheduling with time lags. European Journal of Operational Research, 204, 14\u201315.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00769-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00769-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00769-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T03:31:45Z","timestamp":1686195105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00769-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00769-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,12,5]]},"assertion":[{"value":"3 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}