{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:02:54Z","timestamp":1648890174431},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T00:00:00Z","timestamp":1474502400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s12351-016-0265-6","type":"journal-article","created":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T09:21:37Z","timestamp":1474536097000},"page":"293-314","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times"],"prefix":"10.1007","volume":"18","author":[{"given":"Xiaoling","family":"Cao","sequence":"first","affiliation":[]},{"given":"Wen-Hsing","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wen-Hung","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","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","journal-title":"Oper Res"},{"key":"265_CR2","doi-asserted-by":"crossref","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"},{"key":"265_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis A, Pascale G, Pacciarelli D (2009) A Lagrangian approach to single-machine scheduling problems with two competing agents. J Sched 12:401\u2013415","journal-title":"J Sched"},{"key":"265_CR4","doi-asserted-by":"crossref","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, Gawiejnovicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. Models and algorithms. Springer, Berlin"},{"key":"265_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"key":"265_CR6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ijpe.2014.05.004","volume":"156","author":"SR Cheng","year":"2014","unstructured":"Cheng SR (2014) Some new problems on two-agent scheduling to minimize the earliness costs. Int J Prod Econ 156:24\u201330","journal-title":"Int J Prod Econ"},{"key":"265_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2006) Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor Comput Sci 362:273\u2013281","journal-title":"Theor Comput Sci"},{"key":"265_CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2008) Multi-agent scheduling on a single machine with max-form criteria. Eur J Oper Res 188:603\u2013609","journal-title":"Eur J Oper Res"},{"key":"265_CR9","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cie.2010.12.008","volume":"60","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Cheng SR, Wu WH, Hsu PH, Wu CC (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput Ind Eng 60:534\u2013541","journal-title":"Comput Ind Eng"},{"key":"265_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0252-y","author":"SD Dao","year":"2016","unstructured":"Dao SD, Abhary K, Marian R (2016) An innovative model for resource scheduling in VCIM systems. Int J Oper Res. doi: 10.1007\/s12351-016-0252-y","journal-title":"Int J Oper Res"},{"issue":"2","key":"265_CR11","doi-asserted-by":"crossref","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(2):376\u2013384","journal-title":"Eur J Oper Res"},{"key":"265_CR12","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng CT, Cheng CTE, Yuan JJ (2006) A note on the complexity of the two-agent scheduling on a single machine. J Comb Optim 12:387\u2013394","journal-title":"J Comb Optim"},{"key":"265_CR13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.asoc.2015.05.027","volume":"34","author":"D Lei","year":"2015","unstructured":"Lei D (2015) Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem. Appl Soft Comput 34:721\u2013727","journal-title":"Appl Soft Comput"},{"issue":"3","key":"265_CR14","doi-asserted-by":"crossref","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"},{"key":"265_CR15","first-page":"1","volume":"3","author":"YHV Lun","year":"2011","unstructured":"Lun YHV, Lai KH, Ng CT, Wong CWY, Cheng TCE (2011) Research in shipping and transport logistics. Int J Shipp Transp Logist 3:1\u20135","journal-title":"Int J Shipp Transp Logist"},{"issue":"7","key":"265_CR16","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.cor.2011.09.018","volume":"39","author":"D-C Li","year":"2012","unstructured":"Li D-C, Hsu P-H (2012) Solving a two-agent single-machine scheduling problem considering learning effect. Comput Oper Res 39(7):1644\u20131651","journal-title":"Comput Oper Res"},{"key":"265_CR17","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","volume":"109","author":"K Lee","year":"2009","unstructured":"Lee K, Choi BC, Leung JYT, Pinedo ML (2009) Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf Process Lett 109:913\u2013917","journal-title":"Inf Process Lett"},{"key":"265_CR18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","volume":"144","author":"IS Lee","year":"2013","unstructured":"Lee IS (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144:128\u2013134","journal-title":"Int J Prod Econ"},{"key":"265_CR19","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/nav.20138","volume":"53","author":"JYT Leung","year":"2006","unstructured":"Leung JYT, Li H, Pinedo M (2006) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Nav Res Logist 53:243\u2013260","journal-title":"Nav Res Logist"},{"key":"265_CR20","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/j.ejor.2010.03.003","volume":"206","author":"B Mor","year":"2010","unstructured":"Mor B, Mosheiov G (2010) Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur J Oper Res 206:540\u2013546","journal-title":"Eur J Oper Res"},{"key":"265_CR21","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2011","unstructured":"Pinedo M (2011) Scheduling: theory, algorithms and systems, 4th edn. Prentice-Hall, Englewood Cliffs","edition":"4"},{"key":"265_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0253-x","author":"V Riahi","year":"2016","unstructured":"Riahi V, Kazemi M (2016) A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Int J Oper Res. doi: 10.1007\/s12351-016-0253-x","journal-title":"Int J Oper Res"},{"key":"265_CR23","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan G, Vakati RS, Leung JYT, Pinedo M (2010) Scheduling two agents with controllable processing times. Eur J Oper Res 205:528\u2013539","journal-title":"Eur J Oper Res"},{"key":"265_CR24","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.amc.2015.10.059","volume":"273","author":"L Wan","year":"2016","unstructured":"Wan L, Yuan J, Wei L (2016) Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Appl Math Comput 273:912\u2013923","journal-title":"Appl Math Comput"},{"key":"265_CR25","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1007\/s10845-011-0525-5","volume":"23","author":"WH Wu","year":"2012","unstructured":"Wu WH, Cheng SR, Wu CC, Yin Y (2012) Ant colony algorithms for two-agent scheduling with sum-of-processing-times-based learning and deteriorating considerations. J Intell Manuf 23:1985\u20131993","journal-title":"J Intell Manuf"},{"key":"265_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cor.2016.04.021","volume":"74","author":"J Xu","year":"2016","unstructured":"Xu J, Wu C-C, Yin Y, Zhao CL, Chiou Y-T, Lin WC (2016) An order scheduling problem with position-based learning effect. Comput Oper Res 74:175\u2013186","journal-title":"Comput Oper Res"},{"issue":"12","key":"265_CR27","doi-asserted-by":"crossref","first-page":"3062","DOI":"10.1016\/j.cor.2012.03.012","volume":"39","author":"Y Yin","year":"2012","unstructured":"Yin Y, Wu W-H, Cheng S-R, Wu C-C (2012) An investigation on a two-agent single-machine scheduling problem with unequal release dates. Comput Oper Res 39(12):3062\u20133073","journal-title":"Comput Oper Res"},{"issue":"1","key":"265_CR28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1504\/IJSTL.2013.050590","volume":"5","author":"Y Yin","year":"2013","unstructured":"Yin Y, Cheng S-R, Cheng TCE, Wu W-H, Wu C-C (2013a) Two-agent single-machine scheduling with release times and deadlines. Int J Shipp Transp Logist 5(1):75\u201394","journal-title":"Int J Shipp Transp Logist"},{"issue":"2","key":"265_CR29","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1016\/j.asoc.2012.09.026","volume":"13","author":"Y Yin","year":"2013","unstructured":"Yin Y, Wu C-C, Wu W-H, Hsu C-J, Wu W-H (2013b) A branch-and- bound procedure for a single-machine earliness scheduling problem with two agents. Appl Soft Comput 13(2):1042\u20131054","journal-title":"Appl Soft Comput"},{"key":"265_CR30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Cheng SR, Cheng TCE, Wang D-J, Wu C-C (2016a) Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63:41\u201347","journal-title":"Omega"},{"key":"265_CR31","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang Y, Cheng TCE, Wang D-J, Wu C-C (2016b) Two-agent single-machine scheduling to minimize the batch delivery cost. Comput Ind Eng 92:16\u201330","journal-title":"Comput Ind Eng"},{"key":"265_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2505644","author":"Y Yin","year":"2015","unstructured":"Yin Y, Cheng TCE, Wang D-J, Wu C-C (2015) Improved algorithms for single-machine serial-batch scheduling with rejection to minimize total completion time and total rejection cost. IEEE Trans Syst Man Cybern. doi: 10.1109\/TSMC.2015.2505644","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"265_CR33","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1002\/nav.21684","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Xu J, Cheng TCE, Wu C-C, Wang D-J (2016c) Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work. Nav Res Logist 63:172\u2013183","journal-title":"Nav Res Logist"},{"issue":"1","key":"265_CR34","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1016\/j.apm.2012.04.009","volume":"37","author":"X Yu","year":"2013","unstructured":"Yu X, Zhang Y, Xu D, Yin Y (2013) Single machine scheduling problem with two synergetic agents and piece-rate maintenance. Appl Math Model 37(1):1390\u20131399","journal-title":"Appl Math Model"},{"key":"265_CR35","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1504\/IJSTL.2011.040800","volume":"3","author":"F Zhang","year":"2011","unstructured":"Zhang F, Ng CT, Tang G, Cheng TCE, Lun YHV (2011) Inverse scheduling: applications in shipping. Int J Shipp Transp Logist 3:312\u2013322","journal-title":"Int J Shipp Transp Logist"},{"key":"265_CR36","doi-asserted-by":"publisher","unstructured":"Zhang X, Wang Y (2016) Two-agent scheduling problems on a single-machine to minimize the total weighted late work. J Comb Optim. doi: 10.1007\/s10878-016-0017-9","DOI":"10.1007\/s10878-016-0017-9"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-016-0265-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0265-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0265-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T05:44:03Z","timestamp":1601099043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-016-0265-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,22]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s12351-016-0265-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,22]]}}}