{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:44:54Z","timestamp":1777502694098,"version":"3.51.4"},"reference-count":19,"publisher":"Informa UK Limited","issue":"12","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61662088"],"award-info":[{"award-number":["61662088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2020,12,1]]},"DOI":"10.1080\/00207160.2019.1711373","type":"journal-article","created":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T14:34:43Z","timestamp":1578148483000},"page":"2507-2515","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":14,"title":["Vector scheduling with rejection on two machines"],"prefix":"10.1080","volume":"97","author":[{"given":"Bingfei","family":"Dai","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,1,9]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Y. Azar, I.R. Cohen, D. Panigrahi, Randomized algorithms for online vector load balancing, New Orleans, Louisiana Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, pp. 980\u2013991.","DOI":"10.1137\/1.9781611975031.63"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0116-0"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196300522"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799356265"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"S. Im, N. Kell, J. Kulkarni, and D. Panigrahi, Tight bounds for online vector scheduling, Proceedings of IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, pp. 525\u2013544.","DOI":"10.1109\/FOCS.2015.39"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-017-0356-0"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.007"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2785815"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-017-0561-x"},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"A. Meyerson, A. Roytman, and B. Tagiku, Online multidimensional load balancing, Proceedings of Approximation, Randomization, and Combinatorial Optimization, 2013, pp. 287\u2013302.","DOI":"10.1007\/978-3-642-40328-6_21"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.028"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.04.036"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1136081"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2505644"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-016-0304-4"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-016-0339-6"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.12.006"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2019.1711373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T19:11:33Z","timestamp":1620241893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2019.1711373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,9]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12,1]]}},"alternative-id":["10.1080\/00207160.2019.1711373"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2019.1711373","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,9]]},"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=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-07-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-09","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}