{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:19:35Z","timestamp":1759529975892},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,30]],"date-time":"2015-05-30T00:00:00Z","timestamp":1432944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Innovation Fund of China","award":["ID0EA3AG109"],"award-info":[{"award-number":["ID0EA3AG109"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10845-015-1097-6","type":"journal-article","created":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T10:25:48Z","timestamp":1432895148000},"page":"135-153","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An effective detailed operation scheduling in MES based on hybrid genetic algorithm"],"prefix":"10.1007","volume":"29","author":[{"given":"Li","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuoning","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,30]]},"reference":[{"issue":"4","key":"1097_CR1","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., & Schlie, R. (1990). Job-shop scheduling with multi-purpose machines. Computing, 45(4), 369\u2013375.","journal-title":"Computing"},{"key":"1097_CR2","doi-asserted-by":"publisher","unstructured":"Chamnanlor, C., Sethanan, K., Gen, M., & Chien, C. F. (2015). Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. Journal of Intelligent Manufacturing. doi:\n                        10.1007\/s10845-015-1078-92\n                        \n                    .","DOI":"10.1007\/s10845-015-1078-92"},{"issue":"2","key":"1097_CR3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.eswa.2005.04.009","volume":"29","author":"FT Chan","year":"2005","unstructured":"Chan, F. T., Chung, S. H., & Chan, P. L. Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications, 29(2), 364\u2013371.","journal-title":"Expert Systems with Applications"},{"key":"1097_CR4","doi-asserted-by":"publisher","unstructured":"Chang, H. C., & Liu, T. K. (2015). Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. Journal of Intelligent Manufacturing. doi:\n                        10.1007\/s10845-015-1084-y\n                        \n                    .","DOI":"10.1007\/s10845-015-1084-y"},{"key":"1097_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., Ihlow, J., & Lehmann, C. (1999). A genetic algorithm for flexible job-shop scheduling. In 1999 IEEE international conference on robotics and automation, 1999. Proceedings (Vol. 2, pp. 1120\u20131125). IEEE.","DOI":"10.1109\/ROBOT.1999.772512"},{"issue":"3\u20134","key":"1097_CR6","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/s00170-007-1227-1","volume":"39","author":"JC Chen","year":"2008","unstructured":"Chen, J. C., Chen, K. H., Wu, J. J., & Chen, C. W. (2008). A study of the flexible job shop scheduling problem with parallel machines and reentrant process. The International Journal of Advanced Manufacturing Technology, 39(3\u20134), 344\u2013354.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"1097_CR7","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.eswa.2006.08.025","volume":"33","author":"KJ Chen","year":"2007","unstructured":"Chen, K. J., & Ji, P. (2007). A genetic algorithm for dynamic advanced planning and scheduling (DAPS) with a frozen interval. Expert Systems with Applications, 33(4), 1004\u20131010.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"1097_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0360-8352(02)00002-5","volume":"42","author":"IC Choi","year":"2002","unstructured":"Choi, I. C., & Choi, D. S. (2002). A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Computers and Industrial Engineering, 42(1), 43\u201358.","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"1097_CR9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L Giovanni De","year":"2010","unstructured":"De Giovanni, L., & Pezzella, F. (2010). An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. European Journal of Operational Research, 200(2), 395\u2013408.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1097_CR10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10845-005-0021-x","volume":"17","author":"J Gao","year":"2006","unstructured":"Gao, J., Gen, M., & Sun, L. (2006). Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. Journal of Intelligent Manufacturing, 17(4), 493\u2013507.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"1097_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cie.2007.04.010","volume":"53","author":"J Gao","year":"2007","unstructured":"Gao, J., Gen, M., Sun, L., & Zhao, X. (2007). A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers and Industrial Engineering, 53(1), 149\u2013162.","journal-title":"Computers and Industrial Engineering"},{"issue":"9","key":"1097_CR12","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research, 35(9), 2892\u20132907.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"1097_CR13","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10845-011-0622-5","volume":"24","author":"MA Gonz\u00e1lez","year":"2013","unstructured":"Gonz\u00e1lez, M. A., Vela, C. R., Gonz\u00e1lez-Rodr\u00edguez, I., & Varela, R. (2013). Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times. Journal of Intelligent Manufacturing, 24(4), 741\u2013754.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"1097_CR14","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2006.03.003","volume":"50","author":"ZX Guo","year":"2006","unstructured":"Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., & Chan, S. F. (2006). Mathematical model and genetic optimization for the job shop scheduling problem in a mixed-and multi-product assembly environment: a case study based on the apparel industry. Computers and Industrial Engineering, 50(3), 202\u2013219.","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"1097_CR15","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1016\/j.eswa.2007.08.058","volume":"35","author":"ZX Guo","year":"2008","unstructured":"Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., & Chan, S. F. (2008). Genetic optimization of order scheduling with multiple uncertainties. Expert Systems with Applications, 35(4), 1788\u20131801.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"1097_CR16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1097_CR17","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","volume":"179","author":"NB Ho","year":"2007","unstructured":"Ho, N. B., Tay, J. C., & Lai, E. M. K. (2007). An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research, 179(2), 316\u2013333.","journal-title":"European Journal of Operational Research"},{"key":"1097_CR18","doi-asserted-by":"crossref","unstructured":"Lee, K. M., Yamakawa, T., & Lee, K. M. (1998). A genetic algorithm for general machine scheduling problems. In 1998 Second international conference on knowledge-based intelligent electronic systems, 1998. Proceedings KES\u201998 (Vol. 2, pp. 60\u201366). IEEE.","DOI":"10.1109\/KES.1998.725893"},{"issue":"8","key":"1097_CR19","doi-asserted-by":"crossref","first-page":"9248","DOI":"10.1016\/j.eswa.2011.01.136","volume":"38","author":"M Liu","year":"2011","unstructured":"Liu, M., Sun, Z. J., Yan, J. W., & Kang, J. S. (2011). An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem. Expert Systems with Applications, 38(8), 9248\u20139255.","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"1097_CR20","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s10845-011-0520-x","volume":"23","author":"S Meeran","year":"2012","unstructured":"Meeran, S., & Morshed, M. S. (2012). A hybrid genetic Tabu search algorithm for solving job shop scheduling problems: A case study. Journal of intelligent manufacturing, 23(4), 1063\u20131078.","journal-title":"Journal of intelligent manufacturing"},{"issue":"6","key":"1097_CR21","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1007\/s10845-012-0726-6","volume":"25","author":"C Menc\u00eda","year":"2014","unstructured":"Menc\u00eda, C., Sierra, M. R., & Varela, R. (2014). Intensified iterative deepening A* with application to job shop scheduling. Journal of Intelligent Manufacturing, 25(6), 1245\u20131255.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1097_CR22","unstructured":"MESA International. (1997a). The benefits of MES: A report from the field. MESA International White Paper, (1)."},{"key":"1097_CR23","unstructured":"MESA International. (1997b). MES functionalities and MRP to MES data flow possibilities. MESA International White Paper, (2)."},{"issue":"11","key":"1097_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"1097_CR25","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"Nie, L., Gao, L., Li, P., & Li, X. (2013). A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. Journal of Intelligent Manufacturing, 24(4), 763\u2013774.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"1097_CR26","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park, B. J., Choi, H. R., & Kim, H. S. (2003). A hybrid genetic algorithm for the job shop scheduling problems. Computers and Industrial Engineering, 45(4), 597\u2013613.","journal-title":"Computers and Industrial Engineering"},{"issue":"10","key":"1097_CR27","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers and Operations Research, 35(10), 3202\u20133212.","journal-title":"Computers and Operations Research"},{"issue":"10","key":"1097_CR28","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","volume":"53","author":"S Rahnamayan","year":"2007","unstructured":"Rahnamayan, S., Tizhoosh, H. R., & Salama, M. (2007). A novel population initialization method for accelerating evolutionary algorithms. Computers and Mathematics with Applications, 53(10), 1605\u20131614.","journal-title":"Computers and Mathematics with Applications"},{"issue":"6","key":"1097_CR29","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s10845-012-0650-9","volume":"24","author":"JA Ventura","year":"2013","unstructured":"Ventura, J. A., & Yoon, S. (2013). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing, 24(6), 1185\u20131196.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"31","key":"1097_CR30","first-page":"38","volume":"34","author":"J Vijayan","year":"2000","unstructured":"Vijayan, J. (2000). Manufacturing execution systems. Computerworld, 34(31), 38\u201342.","journal-title":"Computerworld"},{"key":"1097_CR31","doi-asserted-by":"crossref","unstructured":"Yazdani, M., Amiri, M., & Zandieh, M. (2010). Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications, 37(1), 678\u2013687.","DOI":"10.1016\/j.eswa.2009.06.007"},{"issue":"6","key":"1097_CR32","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10845-009-0250-5","volume":"21","author":"M Zandieh","year":"2010","unstructured":"Zandieh, M., Mozaffari, E., & Gholami, M. (2010). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of Intelligent Manufacturing, 21(6), 731\u2013743.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"1097_CR33","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38(4), 3563\u20133573.","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"1097_CR34","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q Zhang","year":"2012","unstructured":"Zhang, Q., Manier, H., & Manier, M. A. (2012). A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Computers and Operations Research, 39(7), 1713\u20131723.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"1097_CR35","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ijpe.2012.10.024","volume":"145","author":"R Zhang","year":"2013","unstructured":"Zhang, R., Chang, P., & Wu, C. (2013). A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production. International Journal of Production Economics, 145(1), 38\u201352.","journal-title":"International Journal of Production Economics"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1097-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1097-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1097-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1097-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:18:54Z","timestamp":1559269134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1097-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,30]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1097"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1097-6","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,30]]}}}