{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:02:12Z","timestamp":1729609332580,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1109\/isspit.2012.6621271","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:31Z","timestamp":1381532251000},"page":"000007-000012","source":"Crossref","is-referenced-by-count":0,"title":["Convergence Analysis of the New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem"],"prefix":"10.1109","author":[{"family":"Nguyen Huu Mui","sequence":"first","affiliation":[]},{"family":"Vu Dinh Hoa","sequence":"additional","affiliation":[]},{"family":"Luc Tri Tuyen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Studies on metaheuristics for jobshop and flowshop scheduling problems","year":"2003","author":"yamada","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-008-0134-y"},{"key":"14","first-page":"174","article-title":"A simulated annealing like convergent theory for the simple genetic algorithm","author":"davis","year":"1991","journal-title":"Proc Fourth Int Conf Genetic Algorithms"},{"key":"11","first-page":"109","article-title":"Genetic local search algorithm for the traveling salesman problem","volume":"1","author":"ulder","year":"1994","journal-title":"Parallel Problem Solving from Nature"},{"key":"12","first-page":"474","article-title":"Conventional genetic algorithm for job shop problems","volume":"91","author":"nakano","year":"1991","journal-title":"Proceedings of International Conference on Genetic Algorithms"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-008-9362-x"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-32792-4","author":"seneta","year":"1981","journal-title":"Non-Negative Matrices and Markov Chains"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.4.487"},{"key":"10","first-page":"238","article-title":"A new hybrid genetic algorithm for job shop scheduling problems","author":"mui","year":"2011","journal-title":"Proceedings of the 5-th National Conference of Science and Technology"},{"key":"7","first-page":"91","article-title":"A modied gier and thompson genetic algorithm on the job shop scheduling problem","volume":"22","author":"peng","year":"2006","journal-title":"Matematika"},{"journal-title":"Applied Semi-Markov Processes","year":"2006","author":"janssen","key":"6"},{"journal-title":"Adaptation in Natural and Articial Systems","year":"1975","author":"holland","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/72.265964"},{"key":"9","article-title":"Probability models and applications","author":"tien","year":"2001","journal-title":"Part 1-Markov Chains and its Application"},{"journal-title":"Finite Markov Prosseses and their Applications","year":"1980","author":"losifescu","key":"8"}],"event":{"name":"2012 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","start":{"date-parts":[[2012,12,12]]},"location":"Ho Chi Minh City","end":{"date-parts":[[2012,12,15]]}},"container-title":["2012 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6605721\/6621248\/06621271.pdf?arnumber=6621271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:22Z","timestamp":1498074322000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6621271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isspit.2012.6621271","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}