{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:57:49Z","timestamp":1764842269156,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY18G010012","LY19G010007"],"award-info":[{"award-number":["LY18G010012","LY19G010007"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Higher Education Teaching Reform Project of China","award":["jg20160157"],"award-info":[{"award-number":["jg20160157"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2937812","type":"journal-article","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T16:27:28Z","timestamp":1566923248000},"page":"122164-122182","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance"],"prefix":"10.1109","volume":"7","author":[{"given":"Shenquan","family":"Huang","sequence":"first","affiliation":[]},{"given":"Hongming","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Ya-Chih","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Yarong","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0055-7450","authenticated-orcid":false,"given":"Fuh-Der","family":"Chou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908200"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2016.01.005"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.09.014"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.12.017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.01.003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2016.01.038"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2008.11.008"},{"journal-title":"Fundamentals of Queueing Theory","year":"1998","author":"gross","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.07.029"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.062"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.08.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2007.01.013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.04.010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2008.01.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050143"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.04.014"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/10170660209509183"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.029"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.03.024"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121681"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0248-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.11.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288977"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1403660"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.05.034"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178778"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(92)90233-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.005"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"2002","author":"pinedo","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2009.04.014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.03.005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600791"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.11.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/0951192X.2015.1130247"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.11.009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2898905"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08815720.pdf?arnumber=8815720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:11Z","timestamp":1641987071000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8815720\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2937812","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}