{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:20:45Z","timestamp":1767183645441},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T00:00:00Z","timestamp":1592611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T00:00:00Z","timestamp":1592611200000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12351-020-00577-3","type":"journal-article","created":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T11:02:58Z","timestamp":1592650978000},"page":"1403-1442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Vahid","family":"Nasrollahi","sequence":"first","affiliation":[]},{"given":"Ghasem","family":"Moslehi","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Reisi-Nafchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,20]]},"reference":[{"key":"577_CR1","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:229\u2013242. https:\/\/doi.org\/10.1287\/opre.1030.0092","journal-title":"Oper Res"},{"key":"577_CR2","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 J-C, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin"},{"key":"577_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.5267\/j.ijiec.2017.8.005","volume":"9","author":"MH Ahmadi-Darani","year":"2018","unstructured":"Ahmadi-Darani MH, Moslehi G, Reisi-Nafchi M (2018) A two-agent scheduling problem in a two-machine flowshop. Int J Ind Eng Comput 9:289\u2013306. https:\/\/doi.org\/10.5267\/j.ijiec.2017.8.005","journal-title":"Int J Ind Eng Comput"},{"key":"577_CR4","first-page":"35","volume":"19","author":"MR Amin-Nayeri","year":"2000","unstructured":"Amin-Nayeri MR, Moslehi G (2000) Optimal algorithm for single machine sequencing to minimize early\/tardy cost. Esteghlal J Eng 19:35\u201348 (In Persian)","journal-title":"Esteghlal J Eng"},{"key":"577_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"A Armentano","year":"1999","unstructured":"Armentano VA, Ronconi R (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26:219\u2013235. https:\/\/doi.org\/10.1016\/S0305-0548(98)00060-4","journal-title":"Comput Oper Res"},{"key":"577_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/a:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Cole Smith J (2003) A multiple-criterion model for machine scheduling. J Sched 6:7\u201316. https:\/\/doi.org\/10.1023\/a:1022231419049","journal-title":"J Sched"},{"key":"577_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.cor.2014.02.004","volume":"47","author":"R Benmansour","year":"2014","unstructured":"Benmansour R, Allaoui H, Artiba A, Hanafi S (2014) Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput Oper Res 47:106\u2013113. https:\/\/doi.org\/10.1016\/j.cor.2014.02.004","journal-title":"Comput Oper Res"},{"key":"577_CR7","doi-asserted-by":"publisher","DOI":"10.1080\/0305215x.2018.1458844","author":"R-X Chen","year":"2018","unstructured":"Chen R-X, Li S-S, Li W-J (2018) Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs. Eng Optim. https:\/\/doi.org\/10.1080\/0305215x.2018.1458844","journal-title":"Eng Optim"},{"key":"577_CR8","doi-asserted-by":"crossref","unstructured":"Emmons H, Vairaktarakis G (2013) The two-machine flow shop. In: Flow shop scheduling: theoretical results, algorithms, and applications. Springer: New York","DOI":"10.1007\/978-1-4614-5152-5"},{"key":"577_CR9","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ejor.2016.01.009","volume":"252","author":"BQ Fan","year":"2016","unstructured":"Fan BQ, Cheng TCE (2016) Two-agent scheduling in a flowshop. Eur J Oper Res 252:376\u2013384. https:\/\/doi.org\/10.1016\/j.ejor.2016.01.009","journal-title":"Eur J Oper Res"},{"key":"577_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/00207547808930015","volume":"16","author":"LF Gelders","year":"1978","unstructured":"Gelders LF, Sambandam N (1978) Four simple heuristics for scheduling a flow-shop. Int J Prod Res 16:221\u2013231. https:\/\/doi.org\/10.1080\/00207547808930015","journal-title":"Int J Prod Res"},{"key":"577_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Annals of discrete mathematics","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer PL, Korte BH (eds) Annals of discrete mathematics, vol 5. Elsevier, London, pp 287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X"},{"key":"577_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s12351-014-0166-5","volume":"15","author":"I Hamdi","year":"2015","unstructured":"Hamdi I, Loukil T (2015) Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags. Oper Res Int Journal 15:95\u2013114. https:\/\/doi.org\/10.1007\/s12351-014-0166-5","journal-title":"Oper Res Int Journal"},{"key":"577_CR13","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/00207540310001657595","volume":"42","author":"S Hasija","year":"2004","unstructured":"Hasija S, Rajendran C (2004) Scheduling in flowshops to minimize total tardiness of jobs. Int J Prod Res 42:2289\u20132301. https:\/\/doi.org\/10.1080\/00207540310001657595","journal-title":"Int J Prod Res"},{"key":"577_CR14","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12530","author":"B Jeong","year":"2018","unstructured":"Jeong B, Kim YD, Shim SO (2018) Algorithms for a two-machine flowshop problem with jobs of two classes. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.12530","journal-title":"Int Trans Oper Res"},{"key":"577_CR15","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 Log Quart 1:61\u201368","journal-title":"Naval Res Log Quart"},{"key":"577_CR16","doi-asserted-by":"publisher","first-page":"1750017","DOI":"10.1142\/S0217595917500178","volume":"34","author":"B-G Kim","year":"2017","unstructured":"Kim B-G, Choi B-C, Park M-J (2017) Two-machine and two-agent flow shop with special processing times structures. Asia-Pac J Oper Res 34:1750017","journal-title":"Asia-Pac J Oper Res"},{"key":"577_CR17","doi-asserted-by":"publisher","first-page":"6594","DOI":"10.1016\/j.eswa.2010.02.125","volume":"37","author":"WC Lee","year":"2010","unstructured":"Lee WC, Chen SK, Wu CC (2010) Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem. Expert Syst Appl 37:6594\u20136601","journal-title":"Expert Syst Appl"},{"key":"577_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.cor.2010.04.002","volume":"38","author":"W-C Lee","year":"2011","unstructured":"Lee W-C, Chen S-K, Chen C-W, Wu C-C (2011) A two-machine flowshop problem with two agents. Comput Oper Res 38:98\u2013104. https:\/\/doi.org\/10.1016\/j.cor.2010.04.002","journal-title":"Comput Oper Res"},{"key":"577_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00470-8","author":"Z Li","year":"2019","unstructured":"Li Z, Zhong RY, Barenji AV, Liu JJ, Yu CX, Huang GQ (2019) Bi-objective hybrid flow shop scheduling with common due date. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-019-00470-8","journal-title":"Oper Res Int J"},{"key":"577_CR20","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:229\u2013239. https:\/\/doi.org\/10.1007\/s10878-011-9378-2","journal-title":"J Comb Optim"},{"key":"577_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/03052150802657290","volume":"41","author":"M Mahnam","year":"2009","unstructured":"Mahnam M, Moslehi G (2009) A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Eng Optim 41:521\u2013536. https:\/\/doi.org\/10.1080\/03052150802657290","journal-title":"Eng Optim"},{"key":"577_CR22","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.ijpe.2009.07.003","volume":"122","author":"G Moslehi","year":"2009","unstructured":"Moslehi G, Mirzaee M, Vasei M, Modarres M, Azaron A (2009) Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. Int J Prod Econ 122:763\u2013773. https:\/\/doi.org\/10.1016\/j.ijpe.2009.07.003","journal-title":"Int J Prod Econ"},{"key":"577_CR23","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1504\/IJOR.2010.034069","volume":"8","author":"G Moslehi","year":"2010","unstructured":"Moslehi G, Mahnam M, Amin-Nayeri M, Azaron A (2010) A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine. Int J Oper Res 8:458\u2013482","journal-title":"Int J Oper Res"},{"key":"577_CR24","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1016\/j.cor.2010.01.002","volume":"37","author":"P Perez-Gonzalez","year":"2010","unstructured":"Perez-Gonzalez P, Framinan JM (2010) Setting a common due date in a constrained flowshop: a variable neighbourhood search approach. Comput Oper Res 37:1740\u20131748. https:\/\/doi.org\/10.1016\/j.cor.2010.01.002","journal-title":"Comput Oper Res"},{"key":"577_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. Eur J Oper Res 235:1\u201316. https:\/\/doi.org\/10.1016\/j.ejor.2013.09.017","journal-title":"Eur J Oper Res"},{"key":"577_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12351-017-0308-7","volume":"20","author":"MA Rakrouki","year":"2020","unstructured":"Rakrouki MA, Kooli A, Chalghoumi S, Ladhari T (2020) A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates. Oper Res Int Journal 20:21\u201335. https:\/\/doi.org\/10.1007\/s12351-017-0308-7","journal-title":"Oper Res Int Journal"},{"key":"577_CR27","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.cie.2015.05.032","volume":"87","author":"Y-R Shiau","year":"2015","unstructured":"Shiau Y-R, Tsai M-S, Lee W-C, Cheng TCE (2015) Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Comput Ind Eng 87:580\u2013589. https:\/\/doi.org\/10.1016\/j.cie.2015.05.032","journal-title":"Comput Ind Eng"},{"key":"577_CR28","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.amc.2004.08.022","volume":"167","author":"R Tavakkoli-Moghaddam","year":"2005","unstructured":"Tavakkoli-Moghaddam R, Moslehi G, Vasei M, Azaron A (2005) Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. Appl Math Comput 167:1430\u20131450. https:\/\/doi.org\/10.1016\/j.amc.2004.08.022","journal-title":"Appl Math Comput"},{"key":"577_CR30","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2017.02.019","volume":"107","author":"M Yazdani","year":"2017","unstructured":"Yazdani M, Aleti A, Khalili SM, Jolai F (2017) Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem. Comput Ind Eng 107:12\u201324. https:\/\/doi.org\/10.1016\/j.cie.2017.02.019","journal-title":"Comput Ind Eng"},{"key":"577_CR31","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10951-017-0511-7","volume":"20","author":"Y Yin","year":"2017","unstructured":"Yin Y, Cheng TCE, Wang DJ, Wu CC (2017) Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J Sched 20:313\u2013335. https:\/\/doi.org\/10.1007\/s10951-017-0511-7","journal-title":"J Sched"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00577-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00577-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00577-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T05:06:58Z","timestamp":1647407218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00577-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,20]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["577"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00577-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,20]]},"assertion":[{"value":"13 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}