{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:44Z","timestamp":1759847204089},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-018-2967-z","type":"journal-article","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T04:16:15Z","timestamp":1533528975000},"page":"511-530","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-machine flowshop scheduling problem with coupled-operations"],"prefix":"10.1007","volume":"275","author":[{"given":"Nadjat","family":"Meziani","sequence":"first","affiliation":[]},{"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Boudhar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"key":"2967_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A. (2008). A \n                    \n                      \n                    \n                    $$\\frac{3}{2}$$\n                    \n                      \n                        \n                          3\n                          2\n                        \n                      \n                    \n                  -approximation for the proportionate two-machine flow shop scheduling with minimum delays. In Lecture Notes in Computer Science (Vol. 4927, pp. 55\u201366).","DOI":"10.1007\/978-3-540-77918-6_5"},{"key":"2967_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, 533\u2013540.","journal-title":"Operations Research Letters"},{"key":"2967_CR3","doi-asserted-by":"crossref","unstructured":"Ageev, A. A., & Kononov, A. V. (2007). Approximation algorithms for scheduling problems with exact delays. In WAOA 2006, LNCS (Vol. 4368, pp. 1\u201314).","DOI":"10.1007\/11970125_1"},{"key":"2967_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 Operational Research, 59, 193\u2013203.","journal-title":"Mathematical Methods of Operational Research"},{"key":"2967_CR5","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, 453\u2013461.","journal-title":"Journal of Scheduling"},{"issue":"04","key":"2967_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. (2012). New algorithms for coupled tasks scheduling\u2014A survey. RAIRO - Operations Research, 46(04), 335\u2013353.","journal-title":"RAIRO - Operations Research"},{"issue":"2","key":"2967_CR7","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. Computers and Operational Research, 36(2), 301\u2013307.","journal-title":"Computers and Operational Research"},{"key":"2967_CR8","unstructured":"Chu C., & Proth, J.-M. (1994). Sequencing with chain structured precedence constraints and minimal and maximal separation times. In Proceedings of the fourth international conference on computer integrated manufacturing and automation technology (pp. 333\u2013338)."},{"issue":"5","key":"2967_CR9","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1287\/opre.44.5.777","volume":"44","author":"M Dell\u2019Amico","year":"1996","unstructured":"Dell\u2019Amico, M. (1996). Shop problems with two machines and time lags. Operations Research, 44(5), 777\u2013787.","journal-title":"Operations Research"},{"key":"2967_CR10","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1016\/j.cor.2004.11.006","volume":"33","author":"J Fondrevelle","year":"2006","unstructured":"Fondrevelle, J., Oulamara, A., & Portmann, M. C. (2006). Permutation flowshop scheduling problem with maximal and minimal time lags. Computers and Operations Research, 33, 1540\u20131556.","journal-title":"Computers and Operations Research"},{"key":"2967_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ijpe.2006.08.018","volume":"112","author":"J Fondrevelle","year":"2008","unstructured":"Fondrevelle, J., Oulamara, A., & Portmann, M. C. (2008). Permutation flow shop scheduling problems with time lags to minimize the weighted sum of machine completion times. International Journal of Production Economics, 112, 168\u2013176.","journal-title":"International Journal of Production Economics"},{"key":"2967_CR12","unstructured":"Garey M. R., & Johnson D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness, V. Klee (Ed.). A series of books in the mathematical sciences. San Francisco, CA: W.H. Freeman and Co."},{"key":"2967_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two and three stage production schedules with setup time included. Naval Research Logistics Quarterly, 1, 61\u201367.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2967_CR14","unstructured":"Karuno, Y., & Nagamochi, H. (2003). A better approximation for the two-machine flowshop scheduling problem with time lags. In Algorithms and computation: 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15\u201317, 2003."},{"issue":"3","key":"2967_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/mnsc.5.3.293","volume":"5","author":"LG Mitten","year":"1958","unstructured":"Mitten, L. G. (1958). Sequencing \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   jobs on two jobs with arbitrary time lags. Management Science, 5(3), 293\u2013298.","journal-title":"Management Science"},{"key":"2967_CR16","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. (1997). On the complexity of coupled-task scheduling. Discrete Applied Mathematics, 72, 141\u2013154.","journal-title":"Discrete Applied Mathematics"},{"key":"2967_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/nav.3800270312","volume":"20","author":"RD Shapiro","year":"1980","unstructured":"Shapiro, R. D. (1980). Scheduling coupled tasks. Naval Research Logistics Quarterly, 20, 489\u2013498.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2967_CR18","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.endm.2010.05.082","volume":"36","author":"G Simonin","year":"2010","unstructured":"Simonin, G., Giroudeau, R., & Konig, J. C. (2010). Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electronic Notes in Discrete Mathematics, 36, 647\u2013654.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2967_CR19","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 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"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2967-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2967-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2967-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T23:20:01Z","timestamp":1565047201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2967-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2967"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2967-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,6]]},"assertion":[{"value":"6 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}