{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401412,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T00:00:00Z","timestamp":1722297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T00:00:00Z","timestamp":1722297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2021J01031"],"award-info":[{"award-number":["2021J01031"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["20720220041"],"award-info":[{"award-number":["20720220041"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171402"],"award-info":[{"award-number":["12171402"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10878-024-01198-8","type":"journal-article","created":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T20:01:38Z","timestamp":1722369698000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents"],"prefix":"10.1007","volume":"48","author":[{"given":"Qi-Xia","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2294-9340","authenticated-orcid":false,"given":"Long-Cheng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Min","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Tian-Run","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"issue":"9","key":"1198_CR1","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":"1198_CR2","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":"1198_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling. Models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. Models and algorithms. Springer, Berlin"},{"issue":"2","key":"1198_CR4","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"},{"key":"1198_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis A, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3\u201315","journal-title":"Ann Oper Res"},{"issue":"3","key":"1198_CR6","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"},{"key":"1198_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/s10878-021-00755-9","volume":"43","author":"A Azerine","year":"2022","unstructured":"Azerine A, Boudhar M, Rebaine D (2022) A two-machine no-wait flow shop problem with two competing agents. J Comb Optim 43:168\u2013199","journal-title":"J Comb Optim"},{"issue":"21","key":"1198_CR8","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":"1198_CR9","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"},{"key":"1198_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco"},{"issue":"5","key":"1198_CR11","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":"1198_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy-Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"6","key":"1198_CR13","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"},{"key":"1198_CR14","doi-asserted-by":"crossref","unstructured":"Kellerer H, Pferschy U, Speranza MG (1997) An efficient approximation scheme for the subset-sum problem. In: Leong HW, Imai H, Jain S. (eds) Algorithms and Computation, (ISAAC 1997), 394\u2013403","DOI":"10.1007\/3-540-63890-3_42"},{"key":"1198_CR15","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":"1198_CR16","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":"3","key":"1198_CR17","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":"1","key":"1198_CR18","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"},{"key":"1198_CR19","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01198-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01198-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01198-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T19:10:29Z","timestamp":1724440229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01198-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,30]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1198"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01198-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,7,30]]},"assertion":[{"value":"13 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}