{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:00:04Z","timestamp":1790420404830,"version":"4.1.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T00:00:00Z","timestamp":1445817600000},"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,4]]},"DOI":"10.1007\/s00500-015-1900-5","type":"journal-article","created":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T07:07:30Z","timestamp":1445843250000},"page":"2015-2033","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["A two-agent single-machine scheduling problem with late work criteria"],"prefix":"10.1007","volume":"21","author":[{"given":"Du-Juan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao-Chung","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yau-Ren","family":"Shiau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng-Hsiang","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"key":"1900_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":"1900_CR2","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":"1900_CR3","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"},{"issue":"6","key":"1900_CR4","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tech Sci Inform 3(6):415\u2013420","journal-title":"Tech Sci Inform"},{"key":"1900_CR5","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (1999) Total late work criteria for shop scheduling problems. In: Inderfurth K, Schw\u00f6diauer G, Domschke W, Juhnke F, Kleinschmidt P, Waescher G (eds) Operations research proceedings. Springer, Berlin, pp 354\u2013359"},{"key":"1900_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(03)00339-1","volume":"134","author":"J Blazewicz","year":"2004","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (2004) Open shop scheduling problems with late work criteria. Discret Appl Math 134:1\u201324","journal-title":"Discret Appl Math"},{"key":"1900_CR7","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":"1900_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2012","unstructured":"Gerstl E, Mosheiov G (2012) Scheduling problems with two competing agents to minimize weighted earliness-tardiness. Comput Oper Res 40:109\u2013116","journal-title":"Comput Oper Res"},{"issue":"4","key":"1900_CR9","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.3934\/jimo.2014.10.1071","volume":"10","author":"P Guo","year":"2014","unstructured":"Guo P, Cheng W, Wang Y (2014) A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. J Ind Manag Optim 10(4):1071\u20131090","journal-title":"J Ind Manag Optim"},{"issue":"1","key":"1900_CR10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156\u2013166","journal-title":"Decis Sci"},{"issue":"3","key":"1900_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. INFORMS J Comput 1(3):190\u2013206","journal-title":"INFORMS J Comput"},{"key":"1900_CR12","first-page":"54","volume":"8","author":"NG Hall","year":"2001","unstructured":"Hall NG, Posner ME (2001) Generating experimental data for computation testing with machine scheduling applications. Oper Res 8:54\u2013865","journal-title":"Oper Res"},{"key":"1900_CR13","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":"1900_CR14","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":"1900_CR15","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":"1900_CR16","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"1900_CR17","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10951-011-0253-x","volume":"15","author":"S Li","year":"2012","unstructured":"Li S, Yuan J (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15:629\u2013640","journal-title":"J Sched"},{"key":"1900_CR18","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.cie.2010.03.004","volume":"60","author":"LM Liao","year":"2011","unstructured":"Liao LM, Huang CJ (2011) Tabu search heuristic for two-machine flowshop with batch processing machines. Comput Ind Eng 60:426\u2013432","journal-title":"Comput Ind Eng"},{"key":"1900_CR19","unstructured":"Lin BMT, Hsu SW (2005) Minimizing total late work on a single machine with release and due dates, In: SIAM conference on computational science and engineering, Orlando"},{"key":"1900_CR20","doi-asserted-by":"crossref","first-page":"2290","DOI":"10.1016\/j.apm.2010.11.026","volume":"35","author":"P Liu","year":"2011","unstructured":"Liu P, Yi N, Zhou XY (2011) Two-agent single-machine scheduling problems under increasing linear deterioration. Appl Math Model 35:2290\u20132296","journal-title":"Appl Math Model"},{"key":"1900_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"J Li","year":"2014","unstructured":"Li J, Pan Q, Wang F (2014) A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl Soft Comput 24:63\u201377","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1900_CR22","doi-asserted-by":"crossref","first-page":"685","DOI":"10.3934\/jimo.2015.11.685","volume":"11","author":"G Li","year":"2015","unstructured":"Li G, Lu X (2015) Two-machine scheduling with periodic availability constraints to minimize makespan. J Ind Manag Optim 11(2):685\u2013700","journal-title":"J Ind Manag Optim"},{"key":"1900_CR23","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":"1900_CR24","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor B, Mosheiov G (2011) Single machine batch scheduling with two competing agents to minimize total flowtime. Eur J Oper Res 215:524\u2013531","journal-title":"Eur J Oper Res"},{"key":"1900_CR25","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 two-agent scheduling on a single machine. J Comb Optim 12:387\u2013394","journal-title":"J Comb Optim"},{"key":"1900_CR26","doi-asserted-by":"crossref","unstructured":"Potts CN, Van Wassenhove LN (1991a) Single machine scheduling to minimize total late work. Oper Res 40:586\u2013595","DOI":"10.1287\/opre.40.3.586"},{"key":"1900_CR27","doi-asserted-by":"crossref","unstructured":"Potts CN, Van Wassenhove LN (1991b) Approximation algorithms for scheduling a single machine to minimize total late work. Oper Res Lett 11:261\u2013266","DOI":"10.1016\/0167-6377(92)90001-J"},{"issue":"2","key":"1900_CR28","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3934\/jimo.2015.11.399","volume":"11","author":"J Pei","year":"2015","unstructured":"Pei J, Pardalos PM, Liu X, Fan W, Yang S, Wang L (2015) Coordination of production and transportation in supply chain scheduling. J Ind Manag Optim 11(2):399\u2013419","journal-title":"J Ind Manag Optim"},{"issue":"3","key":"1900_CR29","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S0217595909002249","volume":"26","author":"J Ren","year":"2009","unstructured":"Ren J, Zhang Y, Sun G (2009) The NP-hardness of minimizing the total late work on an unbounded batch machine. Asia-Pac J Oper Res 26(3):351\u2013363","journal-title":"Asia-Pac J Oper Res"},{"key":"1900_CR30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.asoc.2014.07.013","volume":"24","author":"PK Roy","year":"2014","unstructured":"Roy PK, Bhui S, Paul C (2014) Solution of economic load dispatch using hybrid chemical reaction optimization approach. Appl Soft Comput 24:109\u2013125","journal-title":"Appl Soft Comput"},{"key":"1900_CR31","first-page":"59","volume":"55","author":"M Sterna","year":"2007","unstructured":"Sterna M (2007) Dominance relations for two-machine flow shop problem with late work criterion. Bull Pol Acad Sci 55:59\u201369","journal-title":"Bull Pol Acad Sci"},{"key":"1900_CR32","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120\u2013129","journal-title":"Omega"},{"key":"1900_CR33","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"NH Tuong","year":"2012","unstructured":"Tuong NH, Soukhal A, Billaut JC (2012) Single-machine multi-agent scheduling problems with a global objective function. J Sched 15:311\u2013332","journal-title":"J Sched"},{"key":"1900_CR34","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"},{"issue":"2","key":"1900_CR35","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 (2014) 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":"1900_CR36","doi-asserted-by":"crossref","unstructured":"Yin Y, Cheng SR, Cheng TCE, Wu CC, Wu WH (2012a) Two-agent single-machine scheduling with assignable due dates. Appl Math Comput 219:1674\u20131685","DOI":"10.1016\/j.amc.2012.08.008"},{"key":"1900_CR37","doi-asserted-by":"crossref","unstructured":"Yin Y, Cheng SR, Cheng TCE, Wu WH, Wu CC (2013a) Two-agent single-machine scheduling with release times and deadlines. Int J Shipp Transp Logist 5:75\u201394","DOI":"10.1504\/IJSTL.2013.050590"},{"key":"1900_CR38","doi-asserted-by":"crossref","unstructured":"Yin Y, Cheng SR, Wu CC (2012b) Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf Sci 189:282\u2013292","DOI":"10.1016\/j.ins.2011.11.035"},{"key":"1900_CR39","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.asoc.2012.09.026"},{"key":"1900_CR40","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.asoc.2014.05.029","volume":"22","author":"X Yuan","year":"2014","unstructured":"Yuan X, Ji B, Zhang S, Tian H, Hou Y (2014) A new approach for unit commitment problem via binary gravitational search algorithm. Appl Soft Comput 22:249\u2013260","journal-title":"Appl Soft Comput"},{"key":"1900_CR41","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao K, Lu X (2013) Approximation schemes for two-agent scheduling on parallel machines. Theor Comput Sci 468:114\u2013121","journal-title":"Theor Comput Sci"},{"issue":"3","key":"1900_CR42","doi-asserted-by":"crossref","first-page":"691","DOI":"10.3934\/jimo.2014.10.691","volume":"10","author":"CL Zhao","year":"2014","unstructured":"Zhao CL, Yin Y, Cheng TCE, Wu C-C (2014) Single-machine scheduling and due date assignment with rejection and position-dependent processing times. J Ind Manag Optim 10(3):691\u2013700","journal-title":"J Ind Manag Optim"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1900-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1900-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1900-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1900-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T05:57:48Z","timestamp":1653371868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1900-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":42,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1900"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1900-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,26]]}}}