{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:46Z","timestamp":1740122386723,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T00:00:00Z","timestamp":1459555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61273220"],"award-info":[{"award-number":["61273220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10586-016-0557-x","type":"journal-article","created":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T06:22:26Z","timestamp":1459578146000},"page":"769-781","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two game-based solution concepts for a two-agent scheduling problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Bing","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yanhong","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Ruan","sequence":"additional","affiliation":[]},{"given":"Quanle","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"issue":"2","key":"557_CR1","first-page":"1","volume":"29","author":"YH Gu","year":"2012","unstructured":"Gu, Y.H., Tang, G.C.: Scheduling game: new development of Nash bargaining solution. J. Chongqing Norm. Univ. Nat. Sci. 29(2), 1\u20136 (2012)","journal-title":"J. Chongqing Norm. Univ. Nat. Sci."},{"issue":"1","key":"557_CR2","first-page":"6","volume":"31","author":"GC Tang","year":"2014","unstructured":"Tang, G.C., Fan, B.Q., Liu, L.L.: Classifications, advances and prospects of scheduling games. J. Chongqing Norm. Univ. Nat. Sci. 31(1), 6\u201314 (2014)","journal-title":"J. Chongqing Norm. Univ. Nat. Sci."},{"key":"557_CR3","volume-title":"Introduction to sequencing and scheduling","author":"K Baker","year":"1974","unstructured":"Baker, K.: Introduction to sequencing and scheduling. Wiley, New York (1974)"},{"key":"557_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4393-0","volume-title":"Cooperative games on combinatorial structures","author":"JM Bilbao","year":"2000","unstructured":"Bilbao, J.M.: Cooperative games on combinatorial structures. Kluwer Academic, Boston (2000)"},{"issue":"3","key":"557_CR5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0377-2217(89)90427-X","volume":"40","author":"I Curiel","year":"1989","unstructured":"Curiel, I., Pederzoli, G., Tijs, S.: Sequencing games. Eur. J. Oper. Res. 40(3), 344\u2013351 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"557_CR6","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.42.3.566","volume":"42","author":"I Curiel","year":"1994","unstructured":"Curiel, I., Potters, J., Prasad, R., et al.: Sequencing and cooperation. Oper. Res. 42(3), 566\u2013568 (1994)","journal-title":"Oper. Res."},{"issue":"6","key":"557_CR7","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.1120.1110","volume":"60","author":"XQ Cai","year":"2012","unstructured":"Cai, X.Q., Vairaktarakis, G.L.: Coordination of outsourced operations at a third-party facility subject to booking, overtime, and tardiness costs. Oper. Res. 60(6), 1436\u20131450 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"557_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/msom.1090.0265","volume":"12","author":"T Aydinliyim","year":"2010","unstructured":"Aydinliyim, T., Vairaktarakis, G.L.: Coordination of outsourced operations to minimize weighted flow time and capacity booking costs. Manuf. Serv. Oper. Manag. 12(2), 236\u2013255 (2010)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"557_CR9","volume-title":"Lectures in parallel computation","author":"A Gibbons","year":"2005","unstructured":"Gibbons, A., Spirakis, P.: Lectures in parallel computation. Cambridge University, Cambridge (2005)"},{"key":"557_CR10","volume-title":"Distributed and cloud computing: from parallel processing to the internet of things","author":"K Hwang","year":"2011","unstructured":"Hwang, K., Dongarra, J., Fox, C.G.: Distributed and cloud computing: from parallel processing to the internet of things. Morgan Kaufmann, Burlington (2011)"},{"issue":"1","key":"557_CR11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., Smith, J.: A multiple-criterion model for machine scheduling. J. Schedul. 6(1), 7\u201316 (2003)","journal-title":"J. Schedul."},{"issue":"2","key":"557_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., et al.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","journal-title":"Oper. Res."},{"issue":"16","key":"557_CR13","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, B.C., Leung, J., et al.: Approximation algorithms for multi-agent scheduling to minimize total weihted completion time. Inf. Process. Lett. 109(16), 913\u2013917 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"557_CR14","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.: Single machine batch scheduling with two competing agents to minimize total flowtime. Eur. J. Oper. Res. 215(3), 524\u2013531 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"557_CR15","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1016\/j.asoc.2012.10.003","volume":"13","author":"CC Wu","year":"2013","unstructured":"Wu, C.C., Wu, W.H., Chen, J.C., et al.: A study of the single-machine two-agent scheduling problem with release times. Appl. Soft Comput. 13(2), 998\u20131006 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"557_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"NH Tuong","year":"2012","unstructured":"Tuong, N.H., Soukhal, A., Billaut, J.C.: Single-machine multi-agent scheduling problems with a global objective function. J. Schedul. 15(3), 311\u2013321 (2012)","journal-title":"J. Schedul."},{"key":"557_CR17","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., Gawiejnowicz, S., et al.: Multiagent scheduling: models and algorithms. Springer, Berlin (2014)"},{"issue":"3","key":"557_CR18","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/j.ejor.2015.04.001","volume":"245","author":"M Pinedo","year":"2015","unstructured":"Pinedo, M.: \u201cMultiagent scheduling\u2014models and algorithms\u201d by A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, A. Soukhal. Eur. J. Oper. Res. 245(3), 877 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"557_CR19","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., et al.: A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Appl. Soft Comput. 13(2), 1042\u20131054 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"17","key":"557_CR20","doi-asserted-by":"crossref","first-page":"8848","DOI":"10.1016\/j.amc.2013.03.040","volume":"219","author":"P Liu","year":"2013","unstructured":"Liu, P., Yi, N., Zhou, X., et al.: Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Appl. Math. Comput. 219(17), 8848\u20138855 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"557_CR21","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.cor.2012.07.013","volume":"40","author":"TCE Cheng","year":"2013","unstructured":"Cheng, T.C.E., Chung, Y.H., Liao, S.C., et al.: Two-agent single-machine scheduling with release times to minimize the total weighted completion time. Comput. Oper. Res. 40(1), 353\u2013361 (2013)","journal-title":"Comput. Oper. Res."},{"key":"557_CR22","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.: Approximation schemes for two-agent scheduling on parallel machines. Theor. Comput. Sci. 468, 114\u2013121 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"557_CR23","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.: Scheduling problems with two competing agents to minimized weighted earliness-tardiness. Comput. Oper. Res. 40(1), 109\u2013116 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"557_CR24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2013","unstructured":"Fan, B.Q., Cheng, T.C.E., Li, S.S., et al.: Bounded parallel-batching scheduling with two competing agents. J. Schedul. 16(3), 261\u2013271 (2013)","journal-title":"J. Schedul."},{"issue":"Part A","key":"557_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.cor.2014.06.020","volume":"52","author":"S Gawiejnowicz","year":"2014","unstructured":"Gawiejnowicz, S., Suwalski, C.: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. Comput. Oper. Res. 52(Part A), 135\u2013146 (2014)","journal-title":"Comput. Oper. Res."},{"key":"557_CR26","doi-asserted-by":"crossref","unstructured":"Gerstl, E., Mosheiov, G.: Single machine just-in-time scheduling problems with two competing agents. Naval Res. Logist. 61(1), 1\u201316 (2014)","DOI":"10.1002\/nav.21562"},{"key":"557_CR27","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.cor.2014.06.011","volume":"51","author":"WC Lee","year":"2014","unstructured":"Lee, W.C., Wang, J.Y.: A scheduling problem with three competing agents. Comput. Oper. Res. 51, 208\u2013217 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"557_CR28","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10878-011-9424-0","volume":"25","author":"YH Gu","year":"2013","unstructured":"Gu, Y.H., Goh, M., Chen, Q.L., et al.: A new two-party bargaining mechanism. J. Comb. Optim. 25(1), 135\u2013163 (2013)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"557_CR29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10878-011-9434-y","volume":"26","author":"YH Gu","year":"2013","unstructured":"Gu, Y.H., Fan, J., Tang, G.C., et al.: Maximum latency scheduling problem on two-person cooperative games. J. Comb. Optimiz. 26(1), 71\u201381 (2013)","journal-title":"J. Comb. Optimiz."},{"issue":"3","key":"557_CR30","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TASE.2010.2094608","volume":"8","author":"X Luo","year":"2011","unstructured":"Luo, X., Xu, Z., Yu, J., Chen, X.: Building association link network for semantic link on web resources. IEEE Trans. Autom. Sci. Eng. 8(3), 482\u2013494 (2011)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"557_CR31","first-page":"153","volume":"26","author":"Z Xu","year":"2011","unstructured":"Xu, Z., Luo, X., Wang, L.: Incremental building association link network. Comput. Syst. Sci. Eng. 26(3), 153\u2013162 (2011)","journal-title":"Comput. Syst. Sci. Eng."},{"key":"557_CR32","doi-asserted-by":"crossref","unstructured":"Xu, Z., Luo, X., Lu, W.: Association link network: an incremental semantic data model on organizing web resources. In: ICPADS pp. 793\u2013798. (2009)","DOI":"10.1109\/ICPADS.2009.14"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-016-0557-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0557-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0557-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0557-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T12:32:34Z","timestamp":1718454754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-016-0557-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,2]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s10586-016-0557-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2016,4,2]]}}}