乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T15:11:36Z","timestamp":1721229096125},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.02.001","type":"journal-article","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T04:34:17Z","timestamp":1329280457000},"page":"305-313","source":"Crossref","is-referenced-by-count":19,"title":["Coordination mechanisms for parallel machine scheduling"],"prefix":"10.1016","volume":"220","author":[{"given":"Kangbok","family":"Lee","sequence":"first","affiliation":[]},{"given":"Joseph Y.-T.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Michael L.","family":"Pinedo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.02.001_b0005","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","article-title":"Faster algorithms for the shortest path problem","volume":"37","author":"Ahuja","year":"1990","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/j.ejor.2012.02.001_b0010","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","article-title":"On-line routing of virtual circuits with applications to load balancing and machine scheduling","volume":"44","author":"Aspnes","year":"1997","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.001_b0015","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.ejor.2010.02.012","article-title":"Nash equilibria in competitive project scheduling","volume":"205","author":"Averbakh","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.001_b0020","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","article-title":"The competitiveness of on-line assignments","volume":"18","author":"Azar","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ejor.2012.02.001_b0025","unstructured":"Y. Azar, K. Jain, V. Mirrokni, (Almost) optimal coordination mechanisms for unrelated machine scheduling, in: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 323\u2013332."},{"key":"10.1016\/j.ejor.2012.02.001_b0030","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/11786986_28","article-title":"Tight bounds for selfish and greedy load balancing","volume":"4051","author":"Caragiannis","year":"2006","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ejor.2012.02.001_b0035","doi-asserted-by":"crossref","unstructured":"I. Caragiannis, Efficient coordination mechanisms for unrelated machine scheduling, in: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 815\u2013824.","DOI":"10.1137\/1.9781611973068.89"},{"key":"10.1016\/j.ejor.2012.02.001_b0040","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list schedules on uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.001_b0045","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","article-title":"Coordination mechanisms","volume":"410","author":"Christodoulou","year":"2009","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2012.02.001_b0050","doi-asserted-by":"crossref","unstructured":"R. Cole, J.R. Correa, V. Gkatzelis, V. Mirrokni, N. Olver, Inner product spaces for minsum coordination mechanisms, in: L. Fortnow, S.P. Vadhan (Eds.), Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 539\u2013548.","DOI":"10.1145\/1993636.1993708"},{"key":"10.1016\/j.ejor.2012.02.001_b0055","unstructured":"A. Czumaj, B. Vocking, Tight bounds for worst-case equilibria, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 413\u2013420."},{"key":"10.1016\/j.ejor.2012.02.001_b0060","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0213044","article-title":"Scheduling independent tasks on uniform processors","volume":"13","author":"Dobson","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.001_b0065","series-title":"Stirling\u2019s Formula","volume":"vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/j.ejor.2012.02.001_b0070","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","article-title":"A linear time approximation algorithm for multiprocessor scheduling","volume":"19","author":"Finn","year":"1979","journal-title":"BIT Numerical Mathematics"},{"key":"10.1016\/j.ejor.2012.02.001_b0075","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0216037","article-title":"Tighter bounds for LPT scheduling on uniform processors","volume":"16","author":"Friesen","year":"1987","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.001_b0080","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/j.ejor.2012.02.001_b0085","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.001_b0090","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1111\/j.1937-5956.2007.tb00271.x","article-title":"Games and mechanism design in machine scheduling \u2013 An introduction","volume":"16","author":"Heydenreich","year":"2007","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2012.02.001_b0095","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","article-title":"Heuristic algorithms for scheduling independent tasks on nonidentical processors","volume":"24","author":"Ibarra","year":"1977","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ejor.2012.02.001_b0100","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","article-title":"Coordination mechanisms for selfish scheduling","volume":"410","author":"Immorlica","year":"2009","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2012.02.001_b0105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01585755","article-title":"A strongly polynomial algorithm for the transportation problem","volume":"68","author":"Kleinschmidt","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.001_b0110","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","article-title":"Worst case bound of an LRF schedule for the mean weighted flow-time problem","volume":"15","author":"Kawaguchi","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2012.02.001_b0115","series-title":"STACS 1999, 16th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"616","article-title":"Worst-case equilibria","volume":"vol. 1563","author":"Koutsoupias","year":"1999"},{"issue":"2","key":"10.1016\/j.ejor.2012.02.001_b0120","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00453-008-9224-9","article-title":"New approximation bounds for LPT scheduling","volume":"57","author":"Kovacs","year":"2010","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.ejor.2012.02.001_b0125","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.disopt.2011.05.001","article-title":"Coordination mechanisms with hybrid local policies","volume":"8","author":"Lee","year":"2011","journal-title":"Discrete Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.001_b0130","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.ejor.2007.06.067","article-title":"Promoting cooperation in selfish computational grids","volume":"199","author":"Rzadca","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.001_b0135","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","article-title":"Performance guarantees of local search for multiprocessor scheduling","volume":"19","author":"Schuurman","year":"2007","journal-title":"INFORMS Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171200118X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171200118X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T05:29:30Z","timestamp":1543210170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171200118X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S037722171200118X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.02.001","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}