{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:45:05Z","timestamp":1781109905700,"version":"3.54.1"},"reference-count":21,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>In this article, the scheduling of modern industrial production is studied. The research on scheduling of semiconductor packaging and testing is put forward. A new solution of packaging and test scheduling based on dynamic optimization is proposed. The decomposition strategy is used to solve the problem of the encapsulation test scheduling problem. The complexity of the problem is reduced to ensure the consistency of optimization. In the method, an AP clustering algorithm is used to optimize the matching relationship between job and resource. The neural network method is used to solve the problem. The research of this project will fully combine the characteristics of packaging and testing production. In view of the existing production scheduling theory, there is a big gap to a semiconductor packaging and testing enterprises for the actual research background. This simulation experiments show that the method can be used on packaged production scheduling to provide a viable, effective method support.<\/jats:p>","DOI":"10.4018\/ijisscm.2019040103","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T08:00:14Z","timestamp":1552377614000},"page":"36-56","source":"Crossref","is-referenced-by-count":2,"title":["Research on the Production Scheduling Method of a Semiconductor Packaging Test Based With the Clustering Method"],"prefix":"10.4018","volume":"12","author":[{"given":"Zhonghua","family":"Han","sequence":"first","affiliation":[{"name":"Faculty of Information and Control Engineering, Shenyang Jianzhu University, Shenyang, China & Department of Digital Faculty, Shenyang Institute of Automation, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Faculty of Information and Control Engineering, Shenyang Jianzhu University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongqing","family":"Jiang","sequence":"additional","affiliation":[{"name":"Chongqing University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Duan","sequence":"additional","affiliation":[{"name":"Shenyang Institute of Automation, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJISSCM.2019040103-0","doi-asserted-by":"crossref","unstructured":"Bao, L., & Zeng, J. (2009). Comparison and analysis of the selection mechanism in the artificial bee colony algorithm. In 9th International Conference on Hybrid Intelligent Systems, Los Alamitos, CA (Vol. 1, pp. 411-416). IEEE.","DOI":"10.1109\/HIS.2009.319"},{"issue":"4","key":"IJISSCM.2019040103-1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","article-title":"A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing.","volume":"19","author":"A.Bitar","year":"2016","journal-title":"Journal of Scheduling"},{"key":"IJISSCM.2019040103-2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"IJISSCM.2019040103-3","author":"J. R.Jackson","year":"1955","journal-title":"Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Science Research Projects"},{"issue":"1","key":"IJISSCM.2019040103-4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","article-title":"Hybrid Particle Swarm Optimization Combined With Genetic Operators for Flexible Job-Shop Scheduling Under Uncertain Processing Time for Semiconductor Manufacturing.","volume":"31","author":"T.Jamrus","year":"2018","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"IJISSCM.2019040103-5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cie.2016.03.019","article-title":"Synchronized production planning and scheduling in semiconductor fabrication.","volume":"96","author":"S. H.Kim","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"IJISSCM.2019040103-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2014.10.008"},{"key":"IJISSCM.2019040103-7","doi-asserted-by":"publisher","DOI":"10.1109\/9.106156"},{"key":"IJISSCM.2019040103-8","doi-asserted-by":"publisher","DOI":"10.1109\/66.311341"},{"key":"IJISSCM.2019040103-9","first-page":"2808","article-title":"A differential evolution for dynamic optimization problems.","author":"R.Mendes","year":"2005","journal-title":"IEEE Congress on Evolutionary Computation"},{"key":"IJISSCM.2019040103-10","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(01)00671-8"},{"key":"IJISSCM.2019040103-11","author":"E. S.Oliveira","year":"2001","journal-title":"Solving single-track railway scheduling problem using constraint programming"},{"key":"IJISSCM.2019040103-12","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2642997"},{"key":"IJISSCM.2019040103-13","doi-asserted-by":"crossref","unstructured":"Pesch E, Sterna M. (2009). Late work minimization in flow shops by a genetic algorithm. Computers & Industrial Engineering, 57(4), 1202\u20131209.","DOI":"10.1016\/j.cie.2009.05.011"},{"key":"IJISSCM.2019040103-14","unstructured":"Seo, M., & Ventura, J. A. (2008, January). Ant Colony Optimization for Job Shop Scheduling. In IIE Annual Conference. Proceedings (p. 1433). Institute of Industrial and Systems Engineers (IISE)."},{"key":"IJISSCM.2019040103-15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"},{"key":"IJISSCM.2019040103-16","first-page":"11","article-title":"Affinity scheduling","author":"M. S.Squillante","year":"2011","journal-title":"Encyclopedia of Parallel Computing"},{"key":"IJISSCM.2019040103-17","article-title":"An algorithm of multi-subpopulation parameters with hybrid estimation of distribution for semiconductor scheduling with constrained waiting time.","author":"H. K.Wang","year":"2015","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"IJISSCM.2019040103-18","first-page":"87","article-title":"A MILP-based Batch Scheduling for Two-stage Hybrid Flow-shop with Sequence-dependent Setups in Semiconductor Assembly and Test Manufacturing. Automation Science and Engineering (CASE","author":"J.Xiao","year":"2010"},{"key":"IJISSCM.2019040103-19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.knosys.2013.12.011","article-title":"A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem.","volume":"57","author":"X. L.Zheng","year":"2014","journal-title":"Knowledge-Based Systems"},{"key":"IJISSCM.2019040103-20","article-title":"Scheduling of single-arm multi-cluster tools with wafer residency time constraints in semiconductor manufacturing.","author":"Q. H.Zhu","year":"2015","journal-title":"IEEE Transactions on Semiconductor Manufacturing"}],"container-title":["International Journal of Information Systems and Supply Chain Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=225027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T04:05:02Z","timestamp":1651809902000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJISSCM.2019040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":21,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijisscm.2019040103","relation":{},"ISSN":["1935-5726","1935-5734"],"issn-type":[{"value":"1935-5726","type":"print"},{"value":"1935-5734","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}