{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T06:01:20Z","timestamp":1777874480896,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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-1083-z","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T11:58:06Z","timestamp":1430740686000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":86,"title":["A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Po-Hsiang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Muh-Cherng","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Yong-Han","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Chen-Fu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"issue":"17","key":"1083_CR1","doi-asserted-by":"crossref","first-page":"4523","DOI":"10.1080\/00207540210147043","volume":"40","author":"A Baykaso\u01e7lu","year":"2002","unstructured":"Baykaso\u01e7lu, A. (2002). Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. International Journal of Production Research, 40(17), 4523\u20134543.","journal-title":"International Journal of Production Research"},{"key":"1083_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.cie.2010.05.004","volume":"59","author":"W Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., & Wodecki, M. (2010). Parallel hybrid metaheuristics for the flexible job shop problem. Computers & Industrial Engineering, 59, 323\u2013333.","journal-title":"Computers & Industrial Engineering"},{"key":"1083_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41, 157\u2013183.","journal-title":"Annals of Operations Research"},{"key":"1083_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Bruker","year":"1990","unstructured":"Bruker, P., & Schlie, R. (1990). Job-shop scheduling with multi-purpose machines. Computing, 45, 369\u2013375.","journal-title":"Computing"},{"key":"1083_CR5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.eswa.2005.04.009","volume":"29","author":"FTS Chan","year":"2005","unstructured":"Chan, F. T. S., Chung, S. H., & Chan, P. L. Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications, 29, 364\u2013371.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"1083_CR6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1080\/00207540500319229","volume":"44","author":"FTS Chan","year":"2006","unstructured":"Chan, F. T. S., Chung, S. H., & Chan, P. L. Y. (2006). Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems. International Journal of Production Research, 44(3), 523\u2013543.","journal-title":"International Journal of Production Research"},{"key":"1083_CR7","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 & Industrial Engineering, 42, 43\u201358.","journal-title":"Computers & Industrial Engineering"},{"key":"1083_CR8","doi-asserted-by":"crossref","unstructured":"Chou, Y. C., & Cheng, H. H. (2010). An autonomic mobile agent-based system for distributed job shop scheduling. IEEE\/ASME international conference on mechatronics and embedded systems and applications (pp. 113\u2013118).","DOI":"10.1109\/MESA.2010.5552083"},{"key":"1083_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Paulli, J. (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70, 281\u2013306.","journal-title":"Annals of Operations Research"},{"key":"1083_CR10","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, 395\u2013408.","journal-title":"European Journal of Operational Research"},{"key":"1083_CR11","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 & Operations Research, 35, 2892\u20132907.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1083_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"1083_CR13","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley."},{"key":"1083_CR14","volume-title":"Network models and optimization: Multiobjective genetic algorithm approach","author":"M Gen","year":"2008","unstructured":"Gen, M., Cheng, R., & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithm approach. London: Springer."},{"key":"1083_CR15","unstructured":"Gonz\u00e1lez, M. A., Vela, C. R., & Varela, R. (2013). An efficient memetic algorithm for the flexible job shop with setup times. In: Proceedings of the 23th international conference on automated planning and scheduling (pp. 91\u201399)."},{"key":"1083_CR16","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.knosys.2010.07.010","volume":"24","author":"C Guti\u00e9rrez","year":"2011","unstructured":"Guti\u00e9rrez, C., & Garc\u00eda-Magari\u00f1o, I. (2011). Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem. Knowledge-Based Systems, 24, 102\u2013112.","journal-title":"Knowledge-Based Systems"},{"key":"1083_CR17","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","volume":"37","author":"AB Hmida","year":"2010","unstructured":"Hmida, A. B., Haouari, M., Huguet, M. J., & Lopez, P. (2010). Discrepancy search for the flexible job shop scheduling problem. Computers & Operations Research, 37, 2192\u20132201.","journal-title":"Computers & Operations Research"},{"key":"1083_CR18","doi-asserted-by":"crossref","unstructured":"Ho, N. B., & Tay, J. C. (2004). GENACE: An efficient cultural algorithm for solving the flexible job-shop problem. Proceedings of the IEEE congress on evolutionary computation (pp. 1759\u20131766).","DOI":"10.1109\/CEC.2004.1331108"},{"key":"1083_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink, J., Jurisch, B., & Thole, M. (1994). Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum, 15, 205\u2013215.","journal-title":"OR Spektrum"},{"key":"1083_CR20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1024653810491","volume":"14","author":"HZ Jia","year":"2003","unstructured":"Jia, H. Z., Nee, A. Y. C., Fuh, J. Y. H., & Zhang, Y. F. (2003). A modified genetic algorithm for distributed scheduling problems. Journal of Intelligent Manufacturing, 14, 351\u2013362.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1083_CR21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cie.2007.06.024","volume":"53","author":"HZ Jia","year":"2007","unstructured":"Jia, H. Z., Nee, A. Y. C., Fuh, J. Y. H., & Zhang, Y. F. (2007). Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computer & Industrial Engineering, 53, 313\u2013320.","journal-title":"Computer & Industrial Engineering"},{"key":"1083_CR22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","volume":"47","author":"S Jia","year":"2014","unstructured":"Jia, S., & Hu, Z. H. (2014). Path-relinking tabu search for the multi-objective flexible job shop scheduling problem. Computers & Operations Research, 47, 11\u201326.","journal-title":"Computers & Operations Research"},{"key":"1083_CR23","unstructured":"Jinyan, M., Chai, S. Y., & Youyi, W. (1995). FMS jobshop scheduling using lagrangian relaxation method. Proceedings of IEEE international conference on robotics and automation (pp. 490\u2013495)."},{"issue":"1","key":"1083_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002a). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 32(1), 1\u201313.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews"},{"key":"1083_CR25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002b). Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245\u2013276.","journal-title":"Mathematics and Computers in Simulation"},{"issue":"12","key":"1083_CR26","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1080\/002075499190491","volume":"37","author":"K-H Kim","year":"1999","unstructured":"Kim, K.-H., & Egbelu, P. J. (1999). Scheduling in a production environment with multiple process plans per job. International Journal of Production Research, 37(12), 2725\u20132753.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"1083_CR27","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1093\/ietcom\/e89-b.4.1091","volume":"E89\u2013B","author":"L Lin","year":"2006","unstructured":"Lin, L., & Gen, M. (2006). Node-based genetic algorithm for communication spanning tree problem. IEICE Transactions on Communications, E89\u2013B(4), 1091\u20131098.","journal-title":"IEICE Transactions on Communications"},{"key":"1083_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., & Gambardella, L. M. (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling, 3, 3\u201320.","journal-title":"Journal of Scheduling"},{"key":"1083_CR29","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 & Operations Research, 35, 3202\u20133212.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1083_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl, G. R., & Julstrom, B. A. (2003). Edge sets: an effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation, 7(3), 225\u2013239.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1083_CR31","first-page":"210","volume":"3103","author":"JC Tay","year":"2004","unstructured":"Tay, J. C., & Wibowo, D. (2004). An effective chromosome representation for evolving flexible job shop schedules. Genetic and Evolutionary Computation, 3103, 210\u2013221.","journal-title":"Genetic and Evolutionary Computation"},{"key":"1083_CR32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1008183330452","volume":"11","author":"LF Tung","year":"1999","unstructured":"Tung, L. F., Lin, L., & Nagi, R. (1999). Multi-objective scheduling for the hierarchical control of flexible manufacturing systems. The International Journal of Flexible Manufacturing Systems, 11, 379\u2013409.","journal-title":"The International Journal of Flexible Manufacturing Systems"},{"key":"1083_CR33","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48, 409\u2013425.","journal-title":"Computers & Industrial Engineering"},{"key":"1083_CR34","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing, L. N., Chen, Y. W., Wang, P., Zhao, Q. S., & Xiong, J. (2010). A knowledge-based ant colony optimization for flexible job shop scheduling problems. Applied Soft Computing, 10, 888\u2013896.","journal-title":"Applied Soft Computing"},{"key":"1083_CR35","doi-asserted-by":"crossref","first-page":"2864","DOI":"10.1016\/j.cor.2013.06.010","volume":"40","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., & Xu, H. (2013). An integrated search heuristic for large-scale flexible job shop scheduling problems. Computers & Operations Research, 40, 2864\u20132877.","journal-title":"Computers & Operations Research"},{"key":"1083_CR36","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, 3563\u20133573.","journal-title":"Expert Systems with Applications"},{"key":"1083_CR37","unstructured":"Zhang, Y. X., Li, L., Wang, H., Zhao, Y. Y., Guo, X., & Meng, C. H. (2008). Approach to the distributed job shop scheduling based on multi-agent. In Proceedings of the IEEE international conference on automation and logistics (pp. 2031\u20132034)."},{"key":"1083_CR38","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s11227-013-0986-8","volume":"67","author":"M Ziaee","year":"2014","unstructured":"Ziaee, M. (2014). A heuristic algorithm for the distributed and flexible job-shop scheduling problem. J Supercomput, 67, 69\u201383.","journal-title":"J Supercomput"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1083-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1083-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1083-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1083-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:18:54Z","timestamp":1559254734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1083-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1083"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1083-z","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,5]]}}}