{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:08:02Z","timestamp":1773965282591,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10878-021-00755-9","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T20:02:26Z","timestamp":1621368146000},"page":"168-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A two-machine no-wait flow shop problem with two competing agents"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2460-3140","authenticated-orcid":false,"given":"Abdennour","family":"Azerine","sequence":"first","affiliation":[]},{"given":"Mourad","family":"Boudhar","sequence":"additional","affiliation":[]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"issue":"3","key":"755_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I Adiri","year":"1982","unstructured":"Adiri I, Pohoryles D (1982) Flowshop\/no-idle or no-wait scheduling to Minimize the sum of completion times. Naval Res Logist Quart 29(3):495\u2013504","journal-title":"Naval Res Logist Quart"},{"key":"755_CR2","doi-asserted-by":"crossref","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. doi 10, no 1007,p 978-3, Springer, Berlin","DOI":"10.1007\/978-3-642-41880-8"},{"issue":"2","key":"755_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"issue":"3","key":"755_CR4","first-page":"289","volume":"9","author":"M Ahmadi-Darani","year":"2018","unstructured":"Ahmadi-Darani M, Moslehi G, Reisi-Nafchi M (2018) A two-agent scheduling problem in a two-machine flowshop. Int J Ind Eng Comput 9(3):289\u2013306","journal-title":"Int J Ind Eng Comput"},{"issue":"3","key":"755_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res 255(3):665\u2013686","journal-title":"Eur J Oper Res"},{"issue":"9","key":"755_CR6","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1057\/palgrave.jors.2601403","volume":"53","author":"A Allahverdi","year":"2002","unstructured":"Allahverdi A, Aldowaisan T (2002) No-wait flowshops with bicriteria of makespan and total completion time. J Oper Res Soc 53(9):1004\u20131015","journal-title":"J Oper Res Soc"},{"issue":"1","key":"755_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/S0377-2217(02)00646-X","volume":"152","author":"A Allahverdi","year":"2004","unstructured":"Allahverdi A, Aldowaisan T (2004) No-wait flowshops with bicriteria of makespan and maximum lateness. Eur J Oper Res 152(1):132\u2013147","journal-title":"Eur J Oper Res"},{"key":"755_CR8","unstructured":"Balas E, Toth P (1985) Branch and bound methods. chapter 10 in: The traveling salesman problem. el lawler, jk lenstra, ahg rinnooy kan, db shmoys"},{"issue":"21","key":"755_CR9","doi-asserted-by":"publisher","first-page":"6273","DOI":"10.1080\/00207543.2010.531775","volume":"49","author":"F Ben Chihaoui","year":"2011","unstructured":"Ben Chihaoui F, Kacem I, Hadj-Alouane AB, Dridi N, Rezg N (2011) No-wait scheduling of a two-machine flow-shop to Minimise the makespan under non-availability constraints and different release dates. Int J Prod Res 49(21):6273\u20136286","journal-title":"Int J Prod Res"},{"issue":"2","key":"755_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/0305215X.2018.1458844","volume":"51","author":"RX Chen","year":"2019","unstructured":"Chen RX, Li SS, Li WJ (2019) Multi-agent scheduling in a no-wait flow shop system to Maximize the weighted number of just-in-time jobs. Eng Optim 51(2):217\u2013230","journal-title":"Eng Optim"},{"issue":"2","key":"755_CR11","first-page":"165","volume":"8","author":"J Fondrevelle","year":"2005","unstructured":"Fondrevelle J, Allahverdi A, Oulamara A (2005) Two-machine no-wait flowshop scheduling problem to Minimize Maximum lateness with separate setup and removal times. Int J Agile Manuf 8(2):165\u2013174","journal-title":"Int J Agile Manuf"},{"issue":"5","key":"755_CR12","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655\u2013679","journal-title":"Oper Res"},{"key":"755_CR13","first-page":"87","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"PC Gilmore","year":"1985","unstructured":"Gilmore PC, Lawler EL, Shmoys DB (1985) Well-solved special cases. In: Lawler EL, Lenstra JK (eds) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New Jersey, pp 87\u2013143"},{"issue":"3","key":"755_CR14","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"issue":"2","key":"755_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0305-0548(94)E0007-T","volume":"22","author":"JC Ho","year":"1995","unstructured":"Ho JC, Gupta JN (1995) Flowshop scheduling with dominant machines. Comput Oper Res 22(2):237\u2013246","journal-title":"Comput Oper Res"},{"issue":"6","key":"755_CR16","doi-asserted-by":"publisher","first-page":"3123","DOI":"10.1111\/itor.12530","volume":"27","author":"B Jeong","year":"2020","unstructured":"Jeong B, Kim YD, Shim SO (2020) Algorithms for a two-machine flowshop problem with jobs of two classes. Int Trans Oper Res 27(6):3123\u20133143","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"755_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Naval Res Logist Quart 1(1):61\u201368","journal-title":"Naval Res Logist Quart"},{"key":"755_CR18","unstructured":"Koulamas C, Kyparisis GJ (2020) The no-wait flow shop with rejection. Int J Prod Res, pp 1\u20138"},{"issue":"2","key":"755_CR19","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1080\/00207543.2018.1468097","volume":"57","author":"S Kovalev","year":"2019","unstructured":"Kovalev S, Kovalyov MY, Mosheiov G, Gerstl E (2019) Semi-v-shape property for two-machine no-wait proportionate flow shop problem with tadc criterion. Int J Prod Res 57(2):560\u2013566","journal-title":"Int J Prod Res"},{"issue":"4","key":"755_CR20","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/nav.10118","volume":"51","author":"MA Kubzin","year":"2004","unstructured":"Kubzin MA, Strusevich VA (2004) Two-machine flow shop no-wait scheduling with a nonavailability interval. Naval Res Logist (NRL) 51(4):613\u2013631","journal-title":"Naval Res Logist (NRL)"},{"key":"755_CR21","doi-asserted-by":"publisher","first-page":"16294","DOI":"10.1109\/ACCESS.2018.2815598","volume":"6","author":"M Labidi","year":"2018","unstructured":"Labidi M, Kooli A, Ladhari T, Gharbi A, Suryahatmaja US (2018) A computational study of the two-machine no-wait flow shop scheduling problem subject to unequal release dates and non-availability constraints. IEEE Access 6:16294\u201316304","journal-title":"IEEE Access"},{"issue":"1","key":"755_CR22","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.cor.2010.04.002","volume":"38","author":"WC Lee","year":"2011","unstructured":"Lee WC, Chen SK, Chen CW, Wu CC (2011) A two-machine flowshop problem with two agents. Comput Oper Res 38(1):98\u2013104","journal-title":"Comput Oper Res"},{"issue":"7","key":"755_CR23","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0305-0548(99)00138-0","volume":"28","author":"BM Lin","year":"2001","unstructured":"Lin BM, Cheng TE (2001) Batch scheduling in the no-wait two-machine flowshop to Minimize the makespan. Comput Oper Res 28(7):613\u2013624","journal-title":"Comput Oper Res"},{"issue":"3","key":"755_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10878-011-9378-2","volume":"24","author":"W Luo","year":"2012","unstructured":"Luo W, Chen L, Zhang G (2012) Approximation schemes for two-machine flow shop scheduling with two agents. J Comb Optim 24(3):229\u2013239","journal-title":"J Comb Optim"},{"issue":"2","key":"755_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne AS (1960) On the job-shop scheduling problem. Oper Res 8(2):219\u2013223","journal-title":"Oper Res"},{"issue":"1","key":"755_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor B, Mosheiov G (2014) Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J Oper Res Soc 65(1):151\u2013157","journal-title":"J Oper Res Soc"},{"issue":"7","key":"755_CR27","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1287\/mnsc.31.7.852","volume":"31","author":"PS Ow","year":"1985","unstructured":"Ow PS (1985) Focused scheduling in proportionate flowshops. Manage Sci 31(7):852\u2013869","journal-title":"Manage Sci"},{"key":"755_CR28","doi-asserted-by":"crossref","unstructured":"Panwalkar S, Koulamas C (2020) New results for Minimising variation of flow time in two-machine proportionate no-wait flow shops. Int J Prod Res, pp 1\u201311","DOI":"10.1080\/00207543.2020.1740345"},{"key":"755_CR29","unstructured":"Rachamadugu RMV, Vepsalainen A, Morton TE (1982) Scheduling in proportionate flowshops. Carnegie-mellon univ Pittsburgh pa robotics inst, Tech. rep"},{"issue":"1","key":"755_CR30","first-page":"1","volume":"28","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck H (1984) Some new results in flow shop scheduling. Zeitschrift f\u00fcr Oper Res 28(1):1\u201316","journal-title":"Zeitschrift f\u00fcr Oper Res"},{"issue":"4","key":"755_CR31","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/moor.4.4.448","volume":"4","author":"S Sahni","year":"1979","unstructured":"Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Math Oper Res 4(4):448\u2013457","journal-title":"Math Oper Res"},{"key":"755_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2016.12.013","volume":"81","author":"H Samarghandi","year":"2017","unstructured":"Samarghandi H, Behroozi M (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Comput Oper Res 81:141\u2013159","journal-title":"Comput Oper Res"},{"issue":"3","key":"755_CR33","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C Sriskandarajah","year":"1986","unstructured":"Sriskandarajah C, Ladet P (1986) Some no-wait shops scheduling problems: complexity aspect. Eur J Oper Res 24(3):424\u2013438","journal-title":"Eur J Oper Res"},{"issue":"6","key":"755_CR34","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1023\/A:1026200209386","volume":"6","author":"GL Vairaktarakis","year":"2003","unstructured":"Vairaktarakis GL (2003) Simple algorithms for gilmore-gomory\u2019s traveling salesman and related problems. J Sched 6(6):499\u2013520","journal-title":"J Sched"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00755-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00755-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00755-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T08:15:49Z","timestamp":1643444149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00755-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["755"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00755-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,18]]},"assertion":[{"value":"4 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}