{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:37:17Z","timestamp":1771389437101,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T00:00:00Z","timestamp":1420502400000},"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":["J Sched"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10951-014-0414-9","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T10:42:35Z","timestamp":1420454555000},"page":"243-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Scheduling two agent task chains with a central selection mechanism"],"prefix":"10.1007","volume":"18","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"414_CR1","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., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer."},{"issue":"2","key":"414_CR2","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., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229\u2013242.","journal-title":"Operations Research"},{"key":"414_CR3","unstructured":"Agnetis, A., Nicosia, G., Pacifici, A., & Pferschy, U. (2013). Two agents competing for a shared machine. In Proceedings of the 3rd international conference on algorithmic decision theory (ADT 2013), Lecture notes in computer science 8176, pp. 1\u201314, Springer: Berlin."},{"key":"414_CR4","volume-title":"Combinatorial models for multi-agent scheduling problems, in multiprocessor scheduling: Theory and applications","author":"A Agnetis","year":"2007","unstructured":"Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Combinatorial models for multi-agent scheduling problems, in multiprocessor scheduling: Theory and applications. Vienna, Austria: I-Tech Education and Publishing."},{"issue":"1","key":"414_CR5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1504\/IJOR.2009.026243","volume":"6","author":"A Agnetis","year":"2009","unstructured":"Agnetis, A., De Pascale, G., & Pranzo, M. (2009). Computing the Nash solution for scheduling bargaining problems. International Journal of Operational Research, 6(1), 54\u201369.","journal-title":"International Journal of Operational Research"},{"key":"414_CR6","doi-asserted-by":"crossref","unstructured":"Arbib, C., Smriglio, S., & Servilio, M. (2004). A competitive scheduling problem and its relevance to UMTS channel assignment. Networks, 44(2), 132\u2013141.","DOI":"10.1002\/net.20023"},{"issue":"1","key":"414_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., & Smith, J. C. (2003). A multiple criterion model for machine scheduling. Journal of Scheduling, 6(1), 7\u201316.","journal-title":"Journal of Scheduling"},{"issue":"17","key":"414_CR8","doi-asserted-by":"crossref","first-page":"2220","DOI":"10.1002\/cpe.1752","volume":"23","author":"J Cohen","year":"2011","unstructured":"Cohen, J., Cordeiro, D., Trystram, D., & Wagner, F. (2011). Multi-organization scheduling approximation algorithms. Concurrency and computation: Practice and experience, 23(17), 2220\u20132234.","journal-title":"Concurrency and computation: Practice and experience"},{"issue":"3","key":"414_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.ejor.2013.08.047","volume":"233","author":"A Darmann","year":"2014","unstructured":"Darmann, A., Nicosia, G., Pferschy, U., & Schauer, J. (2014). The subset sum game. European Journal of Operational Research, 233(3), 539\u2013549.","journal-title":"European Journal of Operational Research"},{"key":"414_CR10","doi-asserted-by":"crossref","unstructured":"Ding, G., & Sun, S. (2010). Single-machine scheduling problems with two agents competing for makespan (pp. 244\u2013255). Lecture notes in computer science, 6328, Berlin: Springer.","DOI":"10.1007\/978-3-642-15621-2_28"},{"issue":"2","key":"414_CR11","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"MR Garey","year":"1988","unstructured":"Garey, M. R., Tarjan, R. E., & Wilfong, G. T. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13(2), 330\u2013348.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"414_CR12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1111\/j.1937-5956.2012.01355.x","volume":"22","author":"NG Hall","year":"2013","unstructured":"Hall, N. G., & Liu, Z. (2013). Market good flexibility in capacity auctions. Production and Operations Management, 22(2), 459\u2013472.","journal-title":"Production and Operations Management"},{"issue":"1","key":"414_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"Tuong N Huynh","year":"2012","unstructured":"Huynh, Tuong N., Soukhal, A., & Billaut, J.-C. (2012). Single-machine multi-agent scheduling problems with a global objective function. Journal of Scheduling, 15(1), 311\u2013321.","journal-title":"Journal of Scheduling"},{"issue":"24","key":"414_CR14","first-page":"29","volume":"46","author":"AR Jayasudha","year":"2012","unstructured":"Jayasudha, A. R., & Purusothaman, T. (2012). Job scheduling model with job sequencing and prioritizing strategy in grid computing. International Journal of Computer Applications, 46(24), 29\u201332.","journal-title":"International Journal of Computer Applications"},{"key":"414_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/jos.75","volume":"4","author":"JY-T Leung","year":"2001","unstructured":"Leung, J. Y.-T., Dror, M., & Young, G. H. (2001). A note on an open-end bin packing problem. Journal of Scheduling, 4, 201\u2013207.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"414_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10479-011-1057-2","volume":"207","author":"C Marini","year":"2013","unstructured":"Marini, C., Nicosia, G., Pacifici, A., & Pferschy, U. (2013). Strategies in competing subset selection. Annals of Operations Research, 207(1), 181\u2013200.","journal-title":"Annals of Operations Research"},{"key":"414_CR17","doi-asserted-by":"crossref","unstructured":"Nicosia, G., Pacifici, A., & Pferschy, U. (2009). Subset weight maximization with two competing agents. In Proceedings of algorithmic decision theory: ADT 2009, Lecture notes in computer science 5783, pp. 74\u201385, Berlin: Springer.","DOI":"10.1007\/978-3-642-04428-1_7"},{"issue":"16","key":"414_CR18","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/j.dam.2010.11.011","volume":"159","author":"G Nicosia","year":"2011","unstructured":"Nicosia, G., Pacifici, A., & Pferschy, U. (2011). Competitive subset selection with two agents. Discrete Applied Mathematics, 159(16), 1865\u20131877.","journal-title":"Discrete Applied Mathematics"},{"key":"414_CR19","unstructured":"Nicosia, G., Pacifici, A., & Pferschy, U. (2014). Scheduling the tasks of two agents with a central selection mechanism, submitted. available as: Optimization Online 2014\u201302-4222."},{"key":"414_CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1504\/EJIE.2008.017349","volume":"2","author":"C Pessan","year":"2008","unstructured":"Pessan, C., Bouquard, J.-L., & Neron, E. (2008). An unrelated parallel machines model for an industrial production resetting problem. European Journal of Industrial Engineering, 2, 153\u2013171.","journal-title":"European Journal of Industrial Engineering"},{"key":"414_CR21","first-page":"277","volume":"190","author":"MJ Soomer","year":"2008","unstructured":"Soomer, M. J., & Franx, G. J. (2008). Scheduling aircraft landings using airlines\u2019 preferences. Mathematical Programming, 190, 277\u2013291.","journal-title":"Mathematical Programming"},{"key":"414_CR22","volume-title":"Multicriteria scheduling. Theory, models and algorithms","author":"V T\u2019Kindt","year":"2006","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling. Theory, models and algorithms. Berlin: Springer."},{"issue":"1\/2","key":"414_CR23","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1006\/game.2000.0822","volume":"35","author":"MP Wellman","year":"2001","unstructured":"Wellman, M. P., Walsh, W. E., Wurman, P. R., & MacKie-Mason, J. K. (2001). Auction protocols for decentralized scheduling. Games and Economic Behavior, 35(1\/2), 271\u2013303.","journal-title":"Games and Economic Behavior"},{"key":"414_CR24","unstructured":"Ye, D., & Zhang, G. (2012). Coordination mechanisms for selfish parallel jobs scheduling. In M. Agrawal, et al. (Eds.), 9th Annual conference on theory and applications of models of computation, 2012 (pp. 225\u2013236). Lecture notes in computer science 7287. Berlin:Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0414-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0414-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0414-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:51Z","timestamp":1559468391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0414-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["414"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0414-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,6]]}}}