{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:56:08Z","timestamp":1777607768236,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T00:00:00Z","timestamp":1540598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T00:00:00Z","timestamp":1540598400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004792","name":"Minist\u00e8re de l\u2019Enseignement Sup\u00e9rieur et de la Recherche","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004792","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-018-3082-x","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T22:14:32Z","timestamp":1540592072000},"page":"375-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exact method for the two-machine flow-shop problem with time delays"],"prefix":"10.1007","volume":"298","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9482-278X","authenticated-orcid":false,"given":"Mohamed Amine","family":"Mkadem","sequence":"first","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"issue":"2","key":"3082_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219\u2013239.","journal-title":"Omega"},{"issue":"3","key":"3082_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"3082_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, E. (1990). A practical use of jackson\u2019s preemptive schedule for solving the job shop problem. Annals of Operations Research, 26(1\u20134), 269\u2013287.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"3082_CR4","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":"3082_CR5","volume-title":"Flow and open shop scheduling on two machines with transportation times and machine-independant processing times is NP-hard","author":"M Dell\u2019Amico","year":"1996","unstructured":"Dell\u2019Amico, M., & Vaessens, R. J. M. (1996). Flow and open shop scheduling on two machines with transportation times and machine-independant processing times is NP-hard. Modena: Dipartimento di Economia politica, Universit\u00e0 di Modena."},{"key":"3082_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10479-018-2775-5","volume":"267","author":"E Dhouib","year":"2018","unstructured":"Dhouib, E., Teghem, J., & Loukil, T. (2018). Non-permutation flowshop scheduling problem with minimal and maximal time lags: Theoretical study and heuristic. Annals of Operations Research., 267, 101\u2013134.","journal-title":"Annals of Operations Research."},{"key":"3082_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow shop scheduling","author":"H Emmons","year":"2013","unstructured":"Emmons, H., & Vairaktarakis, G. (2013). Flow shop scheduling (Vol. 182). New York: Springer."},{"issue":"6","key":"3082_CR8","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 problems with maximal and minimal time lags. Computers & Operations Research, 33(6), 1540\u20131556.","journal-title":"Computers & Operations Research"},{"key":"3082_CR9","first-page":"287","volume-title":"Discrete optimization II. Annals of discrete mathematics","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. In E. L. Johnson, P. L. Hammer, & B. H. Korte (Eds.), Discrete optimization II. Annals of discrete mathematics (Vol. 5, pp. 287\u2013326). Amsterdam: Elsevier."},{"issue":"1","key":"3082_CR10","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 times included. Naval Research Logistics Quarterly, 1(1), 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"3082_CR11","doi-asserted-by":"crossref","unstructured":"Karuno, Y., & Nagamochi, H. (2003). A better approximation for the two-machine flowshop scheduling problem with time lags. In Proceedings of the 14th international symposium on algorithms and computation, ISAAC 2003, Kyoto, Japan, December 15\u201317, 2003 (pp. 309\u2013318).","DOI":"10.1007\/978-3-540-24587-2_33"},{"issue":"3","key":"3082_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/mnsc.5.3.293","volume":"5","author":"LG Mitten","year":"1959","unstructured":"Mitten, L. G. (1959). Sequencing n jobs on two machines with arbitrary time lags. Management Science, 5(3), 293\u2013298.","journal-title":"Management Science"},{"key":"3082_CR13","doi-asserted-by":"crossref","unstructured":"Mkadem, M. A., Moukrim, A., & Serairi, M. (2017, April). A branch-and-bound algorithm for the two-machine flow-shop problem with time delays. In 2017 4th International conference on control, decision and information technologies (CoDIT) (pp. 0690\u20130695).","DOI":"10.1109\/CoDIT.2017.8102675"},{"key":"3082_CR14","unstructured":"Mkadem, M. A., Moukrim, A., & Serairi, M. (2018). Lower bounds for the two-machine flow shop problem with time delays. In A. Fink, A. F\u00fcgenschuh, & M. J. Geiger (Eds.), Operations research proceedings 2016: Selected papers of the annual international conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30\u2013September 2."},{"issue":"2","key":"3082_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1051\/ro\/2014004","volume":"48","author":"A Moukrim","year":"2014","unstructured":"Moukrim, A., Rebaine, D., & Serairi, M. (2014). A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO-Operations Research, 48(2), 235\u2013254.","journal-title":"RAIRO-Operations Research"},{"issue":"7","key":"3082_CR16","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1080\/0305215X.2015.1099639","volume":"48","author":"MK Msakni","year":"2016","unstructured":"Msakni, M. K., Khallouli, W., Al-Salem, M., & Ladhari, T. (2016). Minimizing the total completion time in a two-machine flowshop problem with time delays. Engineering Optimization, 48(7), 1164\u20131181.","journal-title":"Engineering Optimization"},{"issue":"1","key":"3082_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1051\/ita\/1996300100231","volume":"30","author":"VJ Rayward-Smith","year":"1996","unstructured":"Rayward-Smith, V. J., & Rebaine, D. (1996). Uet flow shop scheduling with delays. RAIRO-Theoretical Informatics and Applications, 30(1), 23\u201330.","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"issue":"2","key":"3082_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cie.2005.01.019","volume":"48","author":"D Rebaine","year":"2005","unstructured":"Rebaine, D. (2005). Flow shop vs. permutation shop with time delays. Computers & Industrial Engineering, 48(2), 357\u2013362.","journal-title":"Computers & Industrial Engineering"},{"key":"3082_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","volume":"77","author":"DA Rossit","year":"2018","unstructured":"Rossit, D. A., Tohm, F., & Frutos, M. (2018). The non-permutation flow-shop scheduling problem: A literature review. Omega, 77, 143\u2013153.","journal-title":"Omega"},{"key":"3082_CR20","doi-asserted-by":"crossref","unstructured":"Schiex, T., & Verfaillie, G. (1993, November). Nogood recording for static and dynamic constraint satisfaction problems. In Proceedings of 1993 IEEE conference on tools with Al (TAI-93) (pp. 48\u201355).","DOI":"10.1109\/TAI.1993.633935"},{"key":"3082_CR21","unstructured":"Yu, W. (1996). The two-machine flow shop problem and the one-machine total tardiness problem. PhD thesis, Eindhoven University of Technology, The Netherlands."},{"issue":"5","key":"3082_CR22","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(5), 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-3082-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3082-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3082-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:04:57Z","timestamp":1775253897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3082-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,27]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3082"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3082-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,27]]},"assertion":[{"value":"27 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}