{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:26:18Z","timestamp":1762298778121,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC)","award":["Grant OPG0105675"],"award-info":[{"award-number":["Grant OPG0105675"]}]},{"name":"National Science Center (Poland)","award":["DEC-2011\/02\/A\/ST6\/00201"],"award-info":[{"award-number":["DEC-2011\/02\/A\/ST6\/00201"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10951-018-0566-0","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T22:08:34Z","timestamp":1523570914000},"page":"583-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Shared processor scheduling"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4000-4818","authenticated-orcid":false,"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,13]]},"reference":[{"key":"566_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."},{"key":"566_CR2","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1080\/00207728108963831","volume":"12","author":"EJ Anderson","year":"1981","unstructured":"Anderson, E. J. (1981). A new continuous model for job-shop scheduling. International Journal of System Science, 12, 1469\u20131475.","journal-title":"International Journal of System Science"},{"key":"566_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1020958815308","volume":"6","author":"V Bharadwaj","year":"2003","unstructured":"Bharadwaj, V., Ghose, D., & Robertazzi, T. G. (2003). Divisible load theory: A new paradigm for load scheduling in distributed systems. Cluster Computing, 6, 7\u201317.","journal-title":"Cluster Computing"},{"issue":"3","key":"566_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/msom.1070.0152","volume":"9","author":"Y Bukchin","year":"2007","unstructured":"Bukchin, Y., & Hanany, E. (2007). Decentralization cost in scheduling: A game-theoretic approach. Manufacturing & Service Operations Management, 9(3), 263\u2013275.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"1\u20133","key":"566_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362(1\u20133), 273\u2013281.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"566_CR6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ejor.2017.03.002","volume":"261","author":"D Dereniowski","year":"2017","unstructured":"Dereniowski, D., & Kubiak, W. (2017). Shared multi-processor scheduling. European Journal of Operational Research, 261(2), 503\u2013514.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"566_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-015-0432-2","volume":"18","author":"B Hezarkhani","year":"2015","unstructured":"Hezarkhani, B., & Kubiak, W. (2015). Decentralized subcontractor scheduling with divisible jobs. Journal of Scheduling, 18(5), 497\u2013511.","journal-title":"Journal of Scheduling"},{"issue":"16","key":"566_CR8","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. Y.-T., & Pinedo, M. L. (2009). Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Information Processing Letters, 109(16), 913\u2013917.","journal-title":"Information Processing Letters"},{"key":"566_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/msom.1120.0410","volume":"15","author":"GL Vairaktarakis","year":"2013","unstructured":"Vairaktarakis, G. L. (2013). Noncooperative games for subcontracting operations. Manufacturing and Service Operations Management, 15, 148\u2013158.","journal-title":"Manufacturing and Service Operations Management"},{"key":"566_CR10","unstructured":"Vairaktarakis, G. L., & Aydinliyim, T. (2007). Centralization versus competition in subcontracting operations. Technical Memorandum Number 819, Case Western Reserve University."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0566-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0566-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0566-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T08:37:17Z","timestamp":1540888637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0566-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,13]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0566-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,4,13]]}}}