{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:45:02Z","timestamp":1740138302322,"version":"3.37.3"},"reference-count":28,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871280, 11971349","11531014","11625105, 11926358","11871280, 11971349"],"award-info":[{"award-number":["11871280, 11971349","11531014","11625105, 11926358","11871280, 11971349"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2020,7,3]]},"DOI":"10.1080\/10556788.2020.1713129","type":"journal-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T10:23:52Z","timestamp":1579083832000},"page":"722-740","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Randomized mechanism design for decentralized network scheduling"],"prefix":"10.1080","volume":"35","author":[{"given":"Jian","family":"Sun","sequence":"first","affiliation":[{"name":"Department of Operations Research and Scientific Computing, Beijing University of Technology, Beijing, People's Republic of China"},{"name":"School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Jiangsu, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Scientific Computing, Beijing University of Technology, Beijing, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deren","family":"Han","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Beijing Advanced Innovation Center for Big Data and Brain Computing (BDBC), Beihang University, Beijing, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjing","family":"Hou","sequence":"additional","affiliation":[{"name":"School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Jiangsu, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2619-3539","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Jiangsu, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.11.1529.20588"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800290114"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2014-0003"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-015-2370-x"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0270"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0588-1"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0204-7"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1086\/261411"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0378-9"},{"key":"CIT0010","unstructured":"J. Edmonds, Submodular functions, matroids and certain polyhedra, Proceedings International Conference on Cumbinatorics (Calgary Canada), 1970, pp. 69\u201387."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0230"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.328"},{"key":"CIT0013","unstructured":"M.X. Goemans, A supermodular relaxation for scheduling with release dates, in Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, W.H. Cunningham, S.T. McCormick, and M. Queyranne, eds., Vol. 1084, Springer, Berlin, 1996, pp. 288\u2013300."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1111\/j.1937-5956.2007.tb00271.x"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0732"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2011.05.006"},{"key":"CIT0017","unstructured":"R.P. Ishii, R.F.D. Mello, and L.T. Yang, A complex network-based approach for job scheduling in grid environments, in High Performance Computing and Communications. Lecture Notes in Computer Science, R. Perrott, B.M. Chapman, J. Subhlok, R.F. de Mello, and L.T. Yang, eds., Vol. 4782, Springer, Berlin, 2007, pp. 204\u2013215."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.694166"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2009.5.95"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-007-0312-x"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0201"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004107"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331530"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.01.008"},{"key":"CIT0025","unstructured":"N. Nisan and A. Ronen, Computationally feasible VCG mechanisms, J. Artificial Intelligence Res. 29 (2007), pp. 19\u201347."},{"key":"CIT0026","unstructured":"S. Raj, E. Telatar, and D. Tse, Jop scheduling and multiple access, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 66 (2003), pp. 127\u2013137."},{"key":"CIT0027","unstructured":"A.S. Schulz, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, in International Conference on Integer Programming and Combinatorial Optimization (Vancouver, B.C., Canada), W.H. Cunningham, S.T. McCormick, and M. Queyranne, eds., vol. 1084, Lecture Notes in Computer Science, Springer-Verlag, New York, 1996, pp. 301\u2013315."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1006\/game.2000.0822"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1713129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T07:44:39Z","timestamp":1619941479000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1713129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7,3]]}},"alternative-id":["10.1080\/10556788.2020.1713129"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1713129","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,1,15]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-06-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}