{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:14:04Z","timestamp":1765354444776},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T00:00:00Z","timestamp":1451865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Research on Coordination Mechanisms for Some Scheduling Game Problems","award":["11201439"],"award-info":[{"award-number":["11201439"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9980-9","type":"journal-article","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T01:33:56Z","timestamp":1451871236000},"page":"567-579","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A coordination mechanism for a scheduling game with parallel-batching machines"],"prefix":"10.1007","volume":"33","author":[{"given":"Q. Q.","family":"Nong","sequence":"first","affiliation":[]},{"given":"G. Q.","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Q. Z.","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"issue":"3","key":"9980_CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes J, Azar Y, Fiat A, Plotkin SA, Waarts O (1997) On-line routing of virtual circuits with applications to load balancing and machine scheduling. J ACM 44(3):486\u2013504","journal-title":"J ACM"},{"issue":"2\u20133","key":"9980_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch B, Azar Y, Richter Y, Tsur D (2006) Tradeoffs in worst-case equilibria. Theor Comput Sci 361(2\u20133):200\u2013209","journal-title":"Theor Comput Sci"},{"key":"9980_CR3","unstructured":"Azar Y, Jain K, Mirrokni VS (2008) (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms, SODA, pp 323-332"},{"issue":"2","key":"9980_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar Y, Naor J, Rom R (1995) The competitiveness of on-line assignments. J Algorithms 18(2):221\u2013237","journal-title":"J Algorithms"},{"key":"9980_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91\u2013103","journal-title":"SIAM J Comput"},{"issue":"36","key":"9980_CR6","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou G, Koutsoupias E, Nanavati A (2009) Coordination mechanisms. Theor Comput Sci 410(36):3327\u20133336","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9980_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj A, Vocking B (2007) Tight bounds for worst-case equilibria. ACM Trans Algorithms (TALG) 3(1):1\u201317","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"9980_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X Deng","year":"2003","unstructured":"Deng X, Poon CK, Zhang Y (2003) Approximation algorithms in batching processing. J Comb Optim 7:247\u2013257","journal-title":"J Comb Optim"},{"key":"9980_CR9","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1137\/0213044","volume":"13","author":"G Dobson","year":"1984","unstructured":"Dobson G (1984) Scheduling independent tasks on uniform processors. SIAM J Comput 13:716\u2013721","journal-title":"SIAM J Comput"},{"issue":"1","key":"9980_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-011-9316-9","volume":"49","author":"C Durr","year":"2011","unstructured":"Durr C, Thang NK (2011) Non-clairvoyant scheduling games. Theory Comput Syst 49(1):3\u201323","journal-title":"Theory Comput Syst"},{"key":"9980_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G Finn","year":"1979","unstructured":"Finn G, Horowitz E (1979) A linear time approximation algorithm for multiprocessor scheduling. BIT 19:312\u2013320","journal-title":"BIT"},{"key":"9980_CR12","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"DK Friesen","year":"1987","unstructured":"Friesen DK (1987) Tighter bounds for LPT scheduling on uniform processors. SIAM J Comput 16:554\u2013560","journal-title":"SIAM J Comput"},{"key":"9980_CR13","doi-asserted-by":"crossref","unstructured":"Gairing M, Lucking T, Mavronicolas M, Monien B (2004) Computing nash equilibria for scheduling on restricted parallel links. In: STOC, pp 613-622","DOI":"10.1145\/1007352.1007446"},{"key":"9980_CR14","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"45","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 45:416\u2013429","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"9980_CR15","doi-asserted-by":"crossref","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 andscheduling: a survey. Ann Discrete Math 5(2):287\u2013326","journal-title":"Ann Discrete Math"},{"key":"9980_CR16","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"OH Ibarra","year":"1997","unstructured":"Ibarra OH, Kim CE (1997) Huristic algorithms for scheduling independent tasks on nonidentical processors. J ACM 24:280\u2013289","journal-title":"J ACM"},{"key":"9980_CR17","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica N, Li L, Mirrokni VS, Schulz A (2009) Coordination mechanisms for selfish scheduling. Theor Comput Sci 410:1589\u20131598","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9980_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369","journal-title":"Comput Sci Rev"},{"key":"9980_CR19","unstructured":"Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1981) Computer aided complexity classification of deterministic scheduling problems. Research report BW138\/81, Mathematisch Centrum, Amsterdam"},{"key":"9980_CR20","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"key":"9980_CR21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee CY, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37:219\u2013236","journal-title":"Int J Prod Res"},{"key":"9980_CR22","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/A:1024858623282","volume":"6","author":"CT Ng","year":"2003","unstructured":"Ng CT, Cheng TCE, Yuan JJ (2003) The single machine batching problem with family setup times to minimize maximum lateness is strongly $$NP$$ N P -hard. J Sched 6:483\u2013490","journal-title":"J Sched"},{"key":"9980_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228\u2013249","journal-title":"Eur J Oper Res"},{"key":"9980_CR24","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"19","author":"P Schuurman","year":"2007","unstructured":"Schuurman P, Vredeveld T (2007) Performance guarantees of local search for multiprocessor scheduling. INFORMS J Comput 19:52\u201363","journal-title":"INFORMS J Comput"},{"key":"9980_CR25","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) A single batch processing machine with non-identical job sizes. Int J Prod Res 32:1615\u20131635","journal-title":"Int J Prod Res"},{"key":"9980_CR26","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang G, Cai X, Wong CK (2001) On-line algorithms for minimizing makespan on batch processing machines. Nav Res Logist 48:241\u2013258","journal-title":"Nav Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9980-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9980-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9980-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9980-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:28Z","timestamp":1559276608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9980-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,4]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9980"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9980-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,4]]}}}