{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:06Z","timestamp":1750220886943,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Natural Science Foundation of China.","award":["Nos.11761042,11461081,11361030,11101193."],"award-info":[{"award-number":["Nos.11761042,11461081,11361030,11101193."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,15]]},"DOI":"10.1145\/3371676.3371690","type":"proceedings-article","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T04:40:36Z","timestamp":1578976836000},"page":"109-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial Time Algorithm for Scheduling on Processing Time Constraints"],"prefix":"10.1145","author":[{"given":"Xuerong","family":"Yue","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China"}]},{"given":"Jiji","family":"Gao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China"}]},{"given":"Zhibin","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China"}]}],"member":"320","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207001"},{"key":"e_1_3_2_1_2_1","first-page":"161","article-title":"On the optimality of fast heuristics for scheduling and storage allocation problems","volume":"3","author":"Coffman E. G.","year":"1978","unstructured":"E. G. Coffman , Jr., Joseph Y.-T. Leung , and D. Slutz . 1978 . On the optimality of fast heuristics for scheduling and storage allocation problems . Found. Control Engr. 3 (1978), 161 -- 169 . E. G. Coffman, Jr., Joseph Y.-T. Leung, and D. Slutz. 1978. On the optimality of fast heuristics for scheduling and storage allocation problems. Found. Control Engr. 3 (1978), 161--169.","journal-title":"Found. Control Engr."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(87)90009-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/71777.71779"},{"volume-title":"European Symposium on Algorithms.","author":"Fleischer R.","key":"e_1_3_2_1_5_1","unstructured":"R. Fleischer and M. Wahl . 2000. Online scheduling revisited . European Symposium on Algorithms. R. Fleischer and M. Wahl. 2000. Online scheduling revisited. European Symposium on Algorithms."},{"key":"e_1_3_2_1_6_1","volume-title":"Bounds for centain multiprocessing anomalies. Bell system Technical Journal. 45","author":"Graham R. L.","year":"1966","unstructured":"R. L. Graham . 1966. Bounds for centain multiprocessing anomalies. Bell system Technical Journal. 45 ( 1966 ), 1563--1581. R. L. Graham. 1966. Bounds for centain multiprocessing anomalies. Bell system Technical Journal. 45 (1966), 1563--1581."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.1.163"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403438"},{"volume-title":"Approximation Algorithms","author":"Vazirani V. V.","key":"e_1_3_2_1_13_1","unstructured":"V. V. Vazirani . 2001. Approximation Algorithms . Springer , Hong Kong . V. V. Vazirani. 2001. Approximation Algorithms. Springer, Hong Kong."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(96)00055-7"},{"volume-title":"Proceedings of the 8th International Conference on Communication and Network Security. ACM","author":"Zheng S.","key":"e_1_3_2_1_15_1","unstructured":"S. Zheng , X. Yue , and Z. Chen . 2018. Parallel machine scheduling with rejection under special conditions . In Proceedings of the 8th International Conference on Communication and Network Security. ACM , 2018: 139--143. S. Zheng, X. Yue, and Z. Chen. 2018. Parallel machine scheduling with rejection under special conditions. In Proceedings of the 8th International Conference on Communication and Network Security. ACM, 2018: 139--143."}],"event":{"name":"ICCNS 2019: 2019 the 9th International Conference on Communication and Network Security","sponsor":["University of Tokyo","Chongqing University of Posts and Telecommunications"],"location":"Chongqing China","acronym":"ICCNS 2019"},"container-title":["Proceedings of the 2019 9th International Conference on Communication and Network Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371676.3371690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371676.3371690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:23Z","timestamp":1750203863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371676.3371690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":15,"alternative-id":["10.1145\/3371676.3371690","10.1145\/3371676"],"URL":"https:\/\/doi.org\/10.1145\/3371676.3371690","relation":{},"subject":[],"published":{"date-parts":[[2019,11,15]]},"assertion":[{"value":"2020-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}