{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T17:39:08Z","timestamp":1769881148468,"version":"3.49.0"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["103-2221-E-327-031-"],"award-info":[{"award-number":["103-2221-E-327-031-"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002768","name":"Bureau of Energy, Ministry of Economic Affairs, Taiwan","doi-asserted-by":"crossref","award":["102-D0629"],"award-info":[{"award-number":["102-D0629"]}],"id":[{"id":"10.13039\/501100002768","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2015]]},"DOI":"10.1109\/access.2015.2481463","type":"journal-article","created":{"date-parts":[[2015,10,8]],"date-time":"2015-10-08T18:50:17Z","timestamp":1444330217000},"page":"1740-1754","source":"Crossref","is-referenced-by-count":54,"title":["Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1932-6337","authenticated-orcid":false,"given":"Hao-Chin","family":"Chang","sequence":"first","affiliation":[]},{"given":"Yeh-Peng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tung-Kuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jyh-Horng","family":"Chou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1039-3"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/ACCESS.2014.2319351","article-title":"Developing a multiobjective optimization scheduling system for a screw manufacturer: A refined genetic algorithm approach","volume":"2","author":"liu","year":"2014","journal-title":"IEEE Access"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2388486"},{"key":"ref13","first-page":"271","article-title":"An application of genetic algorithms for the flexible job-shop scheduling problem","volume":"4","author":"wang","year":"2012","journal-title":"Int J Adv Comput Technol"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.08.028"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.145"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/210680"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/478981"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/986218"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826895"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2014.6870986"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.10.015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2002.1009117"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-004-2283-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.07.038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023073"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2011.04.020"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.asoc.2014.12.001","article-title":"A modified ABC algorithm for the stage shop scheduling problem","volume":"28","author":"nasiri","year":"2015","journal-title":"Appl Soft Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.038"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7042252\/07294739.pdf?arnumber=7294739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:35:29Z","timestamp":1633919729000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7294739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2015.2481463","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}