{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T09:23:10Z","timestamp":1773739390886,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"the National Science Foundation of China (NSFC)","award":["71371015"],"award-info":[{"award-number":["71371015"]}]},{"name":"Special Research Funds in Public Welfare Sector of China","award":["201313009-7"],"award-info":[{"award-number":["201313009-7"]}]},{"name":"Special Research Funds in Public Welfare Sector of China","award":["201413003"],"award-info":[{"award-number":["201413003"]}]},{"name":"Special Funds of National Science and Technology Support Plan of China","award":["2013BAD17B08"],"award-info":[{"award-number":["2013BAD17B08"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tase.2015.2456131","type":"journal-article","created":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T18:48:15Z","timestamp":1438195695000},"page":"1558-1569","source":"Crossref","is-referenced-by-count":30,"title":["Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm"],"prefix":"10.1109","volume":"14","author":[{"given":"Zhongshun","family":"Shi","sequence":"first","affiliation":[]},{"given":"Longfei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Pai","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Leyuan","family":"Shi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.06.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.01.025"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-2860-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-27744-7_3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.030"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.09.012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CoASE.2013.6654049"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.034"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024284828374"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TASE.2008.916761","article-title":"Hybrid nested partitions and mathematical programming approach and its applications","volume":"5","author":"pi","year":"2008","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)90057-P"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2291899"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018959420252"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1002\/(SICI)1520-6750(199610)43:7<971::AID-NAV3>3.0.CO;2-A","article-title":"Sequencing with setup time and order tardiness trade-offs","volume":"43","author":"ching-jong","year":"1996","journal-title":"Naval Research Logistics (NRL)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018913902852"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.1.180"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.10.1389"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20092"},{"key":"ref9","first-page":"177","article-title":"Scheduling customer orders: An alternative production scheduling approach","volume":"3","author":"julien","year":"1990","journal-title":"J Manuf Oper Manage"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.3.390.12436"},{"key":"ref22","first-page":"377","article-title":"An enhanced nested partitions method","author":"sun","year":"2008","journal-title":"Proc IEEE Conf Autom Sci Eng"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2011.649366"},{"key":"ref24","first-page":"409","article-title":"Customer order scheduling to minimize total weighted completion time","author":"wang","year":"2003","journal-title":"Proc 1st Multidiscriplinary Conf Scheduling Theory Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(97)00151-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.04.029"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.09.007"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/8057874\/07172560.pdf?arnumber=7172560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:35:10Z","timestamp":1633919710000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7172560\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tase.2015.2456131","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}