{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:08:04Z","timestamp":1773965284405,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,23]],"date-time":"2015-08-23T00:00:00Z","timestamp":1440288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00500-015-1817-z","type":"journal-article","created":{"date-parts":[[2015,8,22]],"date-time":"2015-08-22T07:19:17Z","timestamp":1440227957000},"page":"805-816","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A two-agent single-machine scheduling problem to minimize the total cost with release dates"],"prefix":"10.1007","volume":"21","author":[{"given":"Du-Juan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yunqiang","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Wen-Hsiang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wen-Hung","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Peng-Hsiang","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,23]]},"reference":[{"key":"1817_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":"1817_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":"1817_CR3","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":"1817_CR4","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":"1817_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"1817_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"H Belouadah","year":"1992","unstructured":"Belouadah H, Posner ME, Potts CN (1992) Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Appl Math 36:213\u2013231","journal-title":"Discrete Appl Math"},{"key":"1817_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.asoc.2014.03.031","volume":"21","author":"J Behnamian","year":"2014","unstructured":"Behnamian J, Fatemi Ghomi SMT (2014) Multi-objective fuzzy multiprocessor flowshop scheduling. Appl Soft Comput 21:139\u2013148","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1817_CR8","doi-asserted-by":"crossref","first-page":"1250013","DOI":"10.1142\/S0217595912500133","volume":"29","author":"SR Cheng","year":"2012","unstructured":"Cheng SR (2012) A single-machine two-agent scheduling problem by GA approach. Asia-Pac J Oper Res 29(2):1250013","journal-title":"Asia-Pac J Oper Res"},{"key":"1817_CR9","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":"1817_CR10","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":"1817_CR11","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 (2011a) 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":"1817_CR12","doi-asserted-by":"crossref","first-page":"8804","DOI":"10.1016\/j.amc.2011.04.005","volume":"217","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Wu WH, Cheng SR, Wu CC (2011b) Two-agent scheduling with position-based deteriorating jobs and learning effects. Appl Math Comput 217:8804\u20138824","journal-title":"Appl Math Comput"},{"key":"1817_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","volume":"141","author":"TCE Cheng","year":"2013","unstructured":"Cheng TCE, Wu C-C, Chen J-C, Wu W-H, Cheng S-R (2013) Two-machine owshop scheduling with a truncated learning function to minimize the makespan. Int J Prod Econ 141:79\u201386","journal-title":"Int J Prod Econ"},{"issue":"4","key":"1817_CR14","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(98)00105-3","volume":"34","author":"MM Dessouky","year":"1998","unstructured":"Dessouky MM (1998) Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Comput Ind Eng 34(4):793\u2013806","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1817_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","volume":"213","author":"D Elvikis","year":"2014","unstructured":"Elvikis D, Kindt VT (2014) Two-agent scheduling on uniform parallel machines with min-max criteria. Ann Oper Res 213(1):79\u201394","journal-title":"Ann Oper Res"},{"issue":"4","key":"1817_CR16","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng Q, Yuan JJ (2007) NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans 11(4):121\u2013126","journal-title":"OR Trans"},{"key":"1817_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2013","unstructured":"Gerstl E, Mosheiov G (2013) Scheduling problems with two competing agents to minimized weighted earliness-tardiness. Comput Oper Res 40:109\u2013116","journal-title":"Comput Oper Res"},{"key":"1817_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.21562","volume":"61","author":"E Gerstl","year":"2014","unstructured":"Gerstl E, Mosheiov G (2014) Single machine just-in-time scheduling problems with two competing agents. Naval Res Logist 61:1\u201316","journal-title":"Naval Res Logist"},{"key":"1817_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ins.2013.11.029","volume":"265","author":"S Han","year":"2014","unstructured":"Han S, Peng Z, Wang S (2014) The maximum flow problem of uncertain network. Inf Sci 265:167\u2013175","journal-title":"Inf Sci"},{"key":"1817_CR20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.asoc.2014.01.040","volume":"19","author":"H Ke","year":"2014","unstructured":"Ke H, Ma J (2014) Modeling project time-cost trade-off in fuzzy random environment. Appl Soft Comput 19:80\u201385","journal-title":"Appl Soft Comput"},{"key":"1817_CR21","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":"1817_CR22","doi-asserted-by":"crossref","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":"1817_CR23","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.cor.2010.04.002","volume":"38","author":"WC Lee","year":"2011","unstructured":"Lee WC, Chen SK, Chen WC, Wu CC (2011) A two-machine flowshop problem with two agents. Comput Oper Res 38:98\u2013104","journal-title":"Comput Oper Res"},{"key":"1817_CR24","doi-asserted-by":"crossref","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","DOI":"10.1287\/opre.1090.0744"},{"key":"1817_CR25","doi-asserted-by":"publisher","unstructured":"Liu G, Zeng Y, Li D, Chen Y (2014) Schedule length and reliability-oriented multi- objective scheduling for distributed computing. Soft Comput. doi: 10.1007\/s00500-014-1360-3","DOI":"10.1007\/s00500-014-1360-3"},{"issue":"3","key":"1817_CR26","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":"1817_CR27","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":"1817_CR28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"MK Marichelvam","year":"2014","unstructured":"Marichelvam MK, Prabaharan T, Yang XS (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl Soft Comput 19:93\u2013101","journal-title":"Appl Soft Comput"},{"key":"1817_CR29","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 TCE, Yuan JJ (2006) A note on the complexity of the problem of two-agent scheduling on a single machine. J Comb Optim 12:387\u2013394","journal-title":"J Comb Optim"},{"key":"1817_CR30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2011.05.041","volume":"215","author":"QQ Nong","year":"2011","unstructured":"Nong QQ, Cheng TCE, Ng CT (2011) Two-agent scheduling to minimize the total cost. Eur J Oper Res 215:39\u201344","journal-title":"Eur J Oper Res"},{"key":"1817_CR31","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ins.2013.12.024","volume":"276","author":"Z-H Ou","year":"2014","unstructured":"Ou Z-H, Chen L-H (2014) A steganographic method based on tetris games. Inf Sci 276:343\u2013353","journal-title":"Inf Sci"},{"key":"1817_CR32","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0377-2217(93)E0290-E","volume":"80","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) Heuristics for scheduling a single machine subject to unequal job release times. Eur J Oper Res 80:397\u2013403","journal-title":"Eur J Oper Res"},{"key":"1817_CR33","doi-asserted-by":"crossref","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","DOI":"10.1023\/A:1008202821328"},{"key":"1817_CR34","doi-asserted-by":"crossref","unstructured":"Tamura Y, Iizuka H, Yamamoto M, Furukawa M (2015) Application of local clustering organization to reactive job-shop scheduling. Soft Comput 29(4):891\u2013899","DOI":"10.1007\/s00500-014-1416-4"},{"key":"1817_CR35","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":"1817_CR36","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1007\/s10845-011-0525-5","volume":"23","author":"W-H Wu","year":"2012","unstructured":"Wu W-H, Cheng S-R, Wu C-C, 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"},{"issue":"2","key":"1817_CR37","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1016\/j.asoc.2012.10.003","volume":"13","author":"C-C Wu","year":"2013","unstructured":"Wu C-C, Wu W-H, Chen J-C, Yin Y, Wu W-H (2013) A study of the single-machine two-agent scheduling problem with release times. Appl Soft Comput 13(2):998\u20131002","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1817_CR38","doi-asserted-by":"crossref","first-page":"591","DOI":"10.3934\/jimo.2014.10.591","volume":"10","author":"W-H Wu","year":"2014","unstructured":"Wu W-H, Yin Y, Wu W-H, Wu C-C, Hsu P-H (2014a) A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents. J Ind Manag Optim 10(2):591\u2013611","journal-title":"J Ind Manag Optim"},{"key":"1817_CR39","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ins.2013.08.030","volume":"256","author":"C-C Wu","year":"2014","unstructured":"Wu C-C, Wu W-H, Wu W-H, Hsu P-H, Yin Y, Xu J (2014b) A single-machine scheduling with a truncated linear deterioration and ready times. Inf Sci 256:109\u2013125","journal-title":"Inf Sci"},{"key":"1817_CR40","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1016\/j.amc.2012.08.008","volume":"219","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng S-R, Cheng TCE, Wu C-C, Wu W-H (2012a) Two-agent single-machine scheduling with assignable due dates. Appl Math Comput 219:1674\u20131685","journal-title":"Appl Math Comput"},{"key":"1817_CR41","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 (2012b) An investigation on a two-agent single-machine scheduling problem with unequal release dates. Comput Oper Res 39:3062\u20133073","journal-title":"Comput Oper Res"},{"key":"1817_CR42","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.ins.2011.11.035","volume":"189","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng S-R, Wu C-C (2012c) Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf Sci 189:282\u2013292","journal-title":"Inf Sci"},{"issue":"1","key":"1817_CR43","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 Transport Logist 5(1):75\u201394","journal-title":"Int J Shipp Transport Logist"},{"key":"1817_CR44","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:1042\u20131054","journal-title":"Appl Soft Comput"},{"key":"1817_CR45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2013.07.026","volume":"256","author":"Y Yin","year":"2014","unstructured":"Yin Y, Wu W-H, Wu W-H, Wu C-C (2014) A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf Sci 256:91\u2013108","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1817-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1817-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T20:19:52Z","timestamp":1653077992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1817-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,23]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["1817"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1817-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,23]]}}}