{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:07Z","timestamp":1750221187352,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:00:00Z","timestamp":1542412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11,17]]},"DOI":"10.1145\/3297097.3297112","type":"proceedings-article","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T20:44:12Z","timestamp":1549399452000},"page":"34-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance"],"prefix":"10.1145","author":[{"given":"Ya-Chih","family":"Tsai","sequence":"first","affiliation":[{"name":"The Department of Hotel Management, Vanung University, Jung-Li, Tao Yuan, Taiwan, R.O.C."}]},{"given":"Yarong","family":"Chen","sequence":"additional","affiliation":[{"name":"The College of Mechanical and Electronic Engineering, Wenzhou University, Wenzhou, Zhejiang, China"}]},{"given":"Fuh-Der","family":"Chou","sequence":"additional","affiliation":[{"name":"The College of Mechanical and Electronic Engineering, Wenzhou University, Wenzhou, Zhejiang, China"}]}],"member":"320","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"Minimizing the makespan in a single machine scheduling problem with a flexible maintenance","author":"Yang D. L.","year":"2002","unstructured":"Yang , D. L. , Hung , C. L. , Hsu , C. J. , and Chern , M. S. 2002 . Minimizing the makespan in a single machine scheduling problem with a flexible maintenance . J. Chin. Inst. Ind. Eng., 19 , ( Feb. 2002), 63--66. Yang, D. L., Hung, C. L., Hsu, C. J., and Chern, M. S. 2002. Minimizing the makespan in a single machine scheduling problem with a flexible maintenance. J. Chin. Inst. Ind. Eng., 19, (Feb. 2002), 63--66.","journal-title":"J. Chin. Inst. Ind. Eng., 19"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00367-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.04.014"},{"key":"e_1_3_2_1_4_1","first-page":"22.1","volume-title":"Machine scheduling with availability constraints. Handbook of scheduling","author":"Lee C.-Y.","year":"2004","unstructured":"Lee , C.-Y. 2004. Machine scheduling with availability constraints. Handbook of scheduling , CRC Press , 2004 , pp. 22.1 -- 22.13 . Lee, C.-Y. 2004. Machine scheduling with availability constraints. Handbook of scheduling, CRC Press, 2004, pp. 22.1--22.13."},{"key":"e_1_3_2_1_5_1","first-page":"111","volume-title":"14th IFAC Symposium on Information Control Problems in Manufacturing Bucharest","author":"Detienne B.","year":"2012","unstructured":"Detienne , B. 2012 . Minimizing the weighted number of late semi-resumable jobs with deterministic machine availability constraints,\" in Proc . 14th IFAC Symposium on Information Control Problems in Manufacturing Bucharest , 2012, pp. 111 -- 116 . Detienne, B. 2012. Minimizing the weighted number of late semi-resumable jobs with deterministic machine availability constraints,\" in Proc. 14th IFAC Symposium on Information Control Problems in Manufacturing Bucharest, 2012, pp. 111--116."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121681"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Wang G. Sun H. and Chu C. 2005. Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res. 133 (Jan. 2005) 183--192.  Wang G. Sun H. and Chu C. 2005. Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res. 133 (Jan. 2005) 183--192.","DOI":"10.1007\/s10479-004-5032-z"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00262-X"}],"event":{"name":"ICRAI 2018: 2018 4th International Conference on Robotics and Artificial Intelligence","sponsor":["Guangdong University of Technology Guangdong University of Technology"],"location":"Guangzhou China","acronym":"ICRAI 2018"},"container-title":["Proceedings of the 2018 4th International Conference on Robotics and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297097.3297112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297097.3297112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:08Z","timestamp":1750210748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297097.3297112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,17]]},"references-count":9,"alternative-id":["10.1145\/3297097.3297112","10.1145\/3297097"],"URL":"https:\/\/doi.org\/10.1145\/3297097.3297112","relation":{},"subject":[],"published":{"date-parts":[[2018,11,17]]},"assertion":[{"value":"2018-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}