{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:41:34Z","timestamp":1786981294199,"version":"build-2736575974"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T00:00:00Z","timestamp":1267920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10845-010-0385-4","type":"journal-article","created":{"date-parts":[[2010,3,6]],"date-time":"2010-03-06T06:38:35Z","timestamp":1267857515000},"page":"341-356","source":"Crossref","is-referenced-by-count":47,"title":["Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling"],"prefix":"10.1007","volume":"23","author":[{"given":"E.","family":"P\u00e9rez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Posada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,3,7]]},"reference":[{"key":"385_CR1","doi-asserted-by":"crossref","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science. doi: 10.1287\/mnsc.34.3.391 .","DOI":"10.1287\/mnsc.34.3.391"},{"key":"385_CR2","doi-asserted-by":"crossref","unstructured":"Amirthagadeswaran, K. S., & Arunachalam, V. P. (2007). Enhancement of performance of genetic algorithm for job shop scheduling problems through inversion operator. International journal of advanced manufacturing technology. doi: 10.1007\/s00170-005-0392-3 .","DOI":"10.1007\/s00170-005-0392-3"},{"key":"385_CR3","unstructured":"Aydin M. E., Fogarty T. C. (2002) Simulated annealing with evolutionary process for job-shop scheduling problems. In: Giannakoglou K., Tsahalis D., Periaux J., Papailiou K., Fogarty T. C. (eds) Evolutionary methods for design, optimisation and control. CIMNE, Barcelona"},{"key":"385_CR4","doi-asserted-by":"crossref","unstructured":"Aydin, M. E., & Fogarty, T. C. (2004a). A simulated annealing algorithm for multi-agent systems: A job-shop scheduling application. Journal of Intelligent Manufacturing. doi: 10.1023\/B:JIMS.0000042665.10086.cf .","DOI":"10.1023\/B:JIMS.0000042665.10086.cf"},{"key":"385_CR5","doi-asserted-by":"crossref","unstructured":"Aydin, M. E., & Fogarty, T. C. (2004b). Teams of autonomous agents for job-shop scheduling problems: An experimental study. Journal of Intelligent Manufacturing. doi: 10.1023\/B:JIMS.0000034108.66105.59 .","DOI":"10.1023\/B:JIMS.0000034108.66105.59"},{"key":"385_CR6","doi-asserted-by":"crossref","unstructured":"Beasley, D., Bull, D., & Marti, R. (1993). A sequential niche technique for multimodal function optimization. Evolutionary Computation. doi: 10.1162\/evco.1993.1.2.101 .","DOI":"10.1162\/evco.1993.1.2.101"},{"key":"385_CR7","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"1997","unstructured":"Brucker P. (1997) Scheduling algorithms (2nd ed.). Springer, Berlin, Germany","edition":"2"},{"key":"385_CR8","unstructured":"Bruns, R. (1993). Direct chromosome representation and advanced genetic operators for production scheduling. In S. Forrest (Ed.), Proc. of the 5th International Conference on Genetic Algorithms (pp. 352\u2013359). San Mateo: Kaufmann."},{"key":"385_CR9","doi-asserted-by":"crossref","unstructured":"Canbolat, Y., & Gundogar, E. (2004). Fuzzy priority rule for job shop scheduling. Journal of Intelligent Manufacturing. doi: 10.1023\/B:JIMS.0000034116.50789.df .","DOI":"10.1023\/B:JIMS.0000034116.50789.df"},{"key":"385_CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier J., Pinson E. (1989) An algorithm for solving the job shop problem. Management Science 35: 164\u2013176","journal-title":"Management Science"},{"key":"385_CR11","unstructured":"Cavichio, D. (1970). Adaptive search using simulated evolution. PhD Thesis. University of Michigan."},{"key":"385_CR12","doi-asserted-by":"crossref","unstructured":"Cede\u00f1o, W., & Vemuri, V. R. (1999). Analysis of speciation and niching in the multi-niche crowding GA. Theoretical Computers Science, (229) (pp. 177\u2013197). Elsevier.","DOI":"10.1016\/S0304-3975(99)00093-6"},{"key":"385_CR13","unstructured":"Davis, L. (1989). Adapting operators probabilities in genetic algorithms. In J. D. Schaffer (Ed.), Proc. of the 3rd International Conference on Genetic Algorithms (pp. 375\u2013378). San Mateo: Kaufmann."},{"key":"385_CR14","unstructured":"Dunwey, G., Fengping, P., & Shifan, X. (2002). Adaptive niche hierarchy genetic algorithm. In Proc. of IEEE TENCON (pp. 39\u201342)."},{"key":"385_CR15","volume-title":"Introduction to evolutionary computing (Natural Computing Series)","author":"A. E. Eiben","year":"2007","unstructured":"Eiben A. E., Smith J. E. (2007) Introduction to evolutionary computing (Natural Computing Series). Springer, Berlin, Germany"},{"key":"385_CR16","doi-asserted-by":"crossref","unstructured":"El-Bouri, A., Azizi, A., & Zolfaghari, S. (2007). A comparative study of a New Heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling. European Journal of Operational Research. doi: 10.1016\/j.ejor.2005.12.013 .","DOI":"10.1016\/j.ejor.2005.12.013"},{"key":"385_CR17","unstructured":"Fang, H. (1994). Genetic algorithms in timetabling and scheduling. Doctoral dissertation. Department of Artificial Intelligence. University of Edinburgh."},{"key":"385_CR18","unstructured":"Fang, H., Ross, P., & Corne, D. (1993). A promising genetic algorithm approach to job shop scheduling, rescheduling and open shop scheduling problem. In S. Forrest (Ed.), Proc. of the 5th International Conference on Genetic Algorithms (pp. 375\u2013382). San Mateo: Kaufmann."},{"key":"385_CR19","volume-title":"Evolutionary computation. The fossil record (Selected readings on the history of evolutionary computation)","year":"1998","unstructured":"Fogel, D. B. (eds) (1998) Evolutionary computation. The fossil record (Selected readings on the history of evolutionary computation). IEEE press, New York"},{"key":"385_CR20","volume-title":"Sequencing and scheduling: An introduction to the mathematics of the job shop","author":"S. French","year":"1982","unstructured":"French S. (1982) Sequencing and scheduling: An introduction to the mathematics of the job shop. Ellis Horwood, Chichester, USA"},{"key":"385_CR21","volume-title":"Computers and intractability: A guide to the theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D. (1979) Computers and intractability: A guide to the theory of NP-Completeness. Freeman, New York"},{"key":"385_CR22","unstructured":"Gento, A. M., & P\u00e9rez, M. E. (2002). Study on the genetic operators for the job shop problem. In Proc. of the First Spanish Conference on Evolutionary and Bioinspired Algorithms (pp. 523\u2013530). M\u00e9rida, Spain, (in Spanish)."},{"key":"385_CR23","doi-asserted-by":"crossref","unstructured":"Geyik, F., & Cedimoglu, I. (2004). The strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing. doi: 10.1023\/B:JIMS.0000034106.86434.46 .","DOI":"10.1023\/B:JIMS.0000034106.86434.46"},{"key":"385_CR24","doi-asserted-by":"crossref","unstructured":"Giffer, B., & Thompson, G. L. (1960). Algorithms for solving production scheduling problems. Operations Research. doi: 10.1287\/opre.8.4.487 .","DOI":"10.1287\/opre.8.4.487"},{"key":"385_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover F., Laguna M. (1997) Tabu search. Kluwer, Boston"},{"key":"385_CR26","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg D. E. (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, MA"},{"key":"385_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The design of innovation: Lessons from and for competent genetic algorithms","author":"D. E. Goldberg","year":"2002","unstructured":"Goldberg D. E. (2002) The design of innovation: Lessons from and for competent genetic algorithms. Kluwer, Boston, MA"},{"key":"385_CR28","unstructured":"Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Proc. of the 2nd International Conference on Genetic Algorithms (pp. 41\u201349)."},{"key":"385_CR29","doi-asserted-by":"crossref","unstructured":"Greenberg, H. (1968). A branch-bound solutions to the general scheduling problem. Operations Research. doi: 10.1287\/opre.16.2.353 .","DOI":"10.1287\/opre.16.2.353"},{"key":"385_CR30","unstructured":"Harik, G. (1995). Finding multiple solutions using restricted tournament selection. In L. Eschelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 24\u201331). Kaufmann, USA."},{"key":"385_CR31","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","volume":"6","author":"E. Hart","year":"2005","unstructured":"Hart E., Ross P., Corne D. (2005) Evolutionary scheduling: A review. Genetic Programming and Evolvable Machines 6: 191\u2013220","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"385_CR32","doi-asserted-by":"crossref","unstructured":"Hasan, S. M. K., Sarker, R., & Cornforth, D. J. (2007). Hybrid genetic algorithm for solving job-shop scheduling problem. In R. Lee, M. U. Chowdhury, S. Ray, & T. Lee (Eds.), Proceedings of the 6th IEEE International Conference on Computer and Information Science (pp. 519\u2013524). July 2007, Melbourne.","DOI":"10.1109\/ICIS.2007.107"},{"key":"385_CR33","volume-title":"Stochastic local search-foundations and applications","author":"H. Hoss","year":"2004","unstructured":"Hoss H., St\u00fctzle T. (2004) Stochastic local search-foundations and applications. Morgan Kaufmann, San Francisco"},{"key":"385_CR34","doi-asserted-by":"crossref","unstructured":"Hu, J. J., & Goodman, E. D. (2004). Robust and efficient genetic algorithms with hierarchical niching and a sustainable evolutionary computation model. In K. Deb, et\u00a0al. (Eds.), GECCO (pp. 1220\u20131232).","DOI":"10.1007\/978-3-540-24854-5_118"},{"key":"385_CR35","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A. S. Jain","year":"1999","unstructured":"Jain A. S., Meeran S. (1999) Theory and methodology deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113: 390\u2013434","journal-title":"European Journal of Operational Research"},{"key":"385_CR36","doi-asserted-by":"crossref","unstructured":"Kim, J., Cho, D., Jung, H., & Lee, C. (2002). Niching genetic algorithm adopting restricted competition selection combined with pattern search method. IEEE Transactions on magnetic. doi: 10.1109\/20.996257 .","DOI":"10.1109\/20.996257"},{"key":"385_CR37","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science. doi: 10.1126\/science.220.4598.671 .","DOI":"10.1126\/science.220.4598.671"},{"key":"385_CR38","unstructured":"Kobayashi, S., Ono, I., & Yamamura, M. (1995). An efficient genetic algorithm for the job shop scheduling problem. In L. Eschelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 506\u2013511). San Francisco: Kaufmann."},{"key":"385_CR39","doi-asserted-by":"crossref","unstructured":"Lee, Ch., Cho, D., & Jung, H. (1999). Niching genetic algorithm with restricted competition selection for multimodal function optimization. IEEE transactions on magnetics. doi: 10.1109\/20.767361 .","DOI":"10.1109\/20.767361"},{"key":"385_CR40","doi-asserted-by":"crossref","unstructured":"Li, J., Balazs, M., Parks, G. T., & Clarkson, P. J. (2002). A species conserving genetic algorithm for multimodal function optimization. Evolutionary computation. doi: 10.1162\/106365602760234081 .","DOI":"10.1162\/106365602760234081"},{"key":"385_CR41","unstructured":"Lin, S., Goodman, E.D., & Punch, W. P. (1997). A genetic approach to dynamic job shop scheduling problems. In T. B\u00e4ck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms (pp. 481\u2013488). San Francisco: Kaufmann."},{"key":"385_CR42","doi-asserted-by":"crossref","unstructured":"Lin, C., & Wu, W. (2002). Niche identification techniques in multimodal genetic search with sharing scheme. Advances in Engineering Software (33), 779\u2013791.","DOI":"10.1016\/S0965-9978(02)00045-5"},{"key":"385_CR43","first-page":"27","volume-title":"Parallel problem solving form nature II","author":"S.W. Mahfoud","year":"1992","unstructured":"Mahfoud S.W. (1992) Crowding and preservation revisited. In: M\u00e4nner R., Manderick B. (eds) Parallel problem solving form nature II. Elsevier, New York, pp 27\u201336"},{"key":"385_CR44","volume-title":"Evolutionary search and the job shop. Investigations on genetic algorithms for production scheduling","author":"D. C. Mattfeld","year":"1995","unstructured":"Mattfeld D. C. (1995) Evolutionary search and the job shop. Investigations on genetic algorithms for production scheduling. Springer, Berlin"},{"key":"385_CR45","volume-title":"Genetic algorithms + Data structures + Evolutions programs","author":"Z. Michalewicz","year":"1995","unstructured":"Michalewicz Z. (1995) Genetic algorithms + Data structures + Evolutions programs. Springer, Berlin, Germany"},{"key":"385_CR46","unstructured":"Nakano, R., & Yamada, T. (1991). Convencional genetic algorithms for job shop problems. In R. Belew, & L. B. Booker (Eds.), Proc. of the 4 th International Conference on Genetic Algorithms (pp. 474\u2013479). California: Kaufmann."},{"key":"385_CR47","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki E., Smutnicki C. (1996) A fast tabu search algorithm for the job shop problem. Management Science 42: 797\u2013813","journal-title":"Management Science"},{"key":"385_CR48","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki E., Smutnicki C. (2005) An advanced tabu algorithm for the job shop problem. Journal of Scheduling 8: 145\u2013 159","journal-title":"Journal of Scheduling"},{"key":"385_CR49","unstructured":"Oei, C. K., Godberg, D. E., & Chang, S. J. (1991). Tournament selection, niching and the preservation of diversity. IlliGAL Report No. 91011. University of Illinois, USA."},{"key":"385_CR50","doi-asserted-by":"crossref","unstructured":"Panwalkar, S. S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research. doi: 10.1287\/opre.25.1.45 .","DOI":"10.1287\/opre.25.1.45"},{"key":"385_CR51","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski, A. (1996). A clearing procedure as a niching method for genetic algorithms. In Proc. IEEE International Conference on Evolutionary Computation (pp. 798\u2013803). Japan.","DOI":"10.1109\/ICEC.1996.542703"},{"key":"385_CR52","unstructured":"P\u00e9trowski, A. (1997). A new selection operator dedicated to speciatin. In T. B\u00e4ck (Ed.), Proc. of the 7 th International Conference on Genetic Algorithms (pp. 144\u2013151). San Mateo: Kaumann."},{"key":"385_CR53","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, E., Herrera, F., Hern\u00e1ndez, C. (2003). Finding multiple solutions in job shop scheduling by niching genetic algorithms. Journal of Intelligent Manufacturing. doi: 10.1023\/A:1024649709582 .","DOI":"10.1023\/A:1024649709582"},{"key":"385_CR54","first-page":"321","volume-title":"Handbook of metaheuristics","author":"H. Ramalhinho","year":"2003","unstructured":"Ramalhinho H., Marti O., St\u00fctzle T. (2003) Iterated local search. In: Glover F., Kochenberger G. A. (eds) Handbook of metaheuristics. Kluwer, MA, pp 321\u2013354"},{"key":"385_CR55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/4235.735432","volume":"2","author":"B. Sareni","year":"1998","unstructured":"Sareni B., Krahenbuhl L. (1998) Fitness sharing and niching methods revisited. IEEE Transactions on Evolutionary Computation 2: 97\u2013106","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"385_CR56","volume-title":"Introduction to genetic algorithms","author":"S. N. Sivanandam","year":"2007","unstructured":"Sivanandam S. N., Deepa S. N. (2007) Introduction to genetic algorithms. Springer, Berlin, Germany"},{"key":"385_CR57","doi-asserted-by":"crossref","unstructured":"Usher, J. (2003). Negotiation-based routing in job shops via collaborative agents. Journal of Intelligent Manufacturing. doi: 10.1023\/A:1025705426184 .","DOI":"10.1023\/A:1025705426184"},{"key":"385_CR58","doi-asserted-by":"crossref","unstructured":"Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, doi: 10.1287\/opre.40.1.113 .","DOI":"10.1287\/opre.40.1.113"},{"key":"385_CR59","doi-asserted-by":"crossref","unstructured":"Vazquez, M., & Whitley, L. D. (2000). A comparison of genetic algorithms for the static job shop scheduling problem. In Parallel Problem Solving from Nature Conference 2000 (PPSN VI) (pp. 303\u2013312).","DOI":"10.1007\/3-540-45356-3_30"},{"key":"385_CR60","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L. Wang","year":"2001","unstructured":"Wang L., Zheng D. Z. (2001) An effective hybrid optimization strategy for job shop scheduling problems. Computers and Operationas Research 28: 585\u2013596","journal-title":"Computers and Operationas Research"},{"issue":"2","key":"385_CR61","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","volume":"143","author":"J. P. Watson","year":"2003","unstructured":"Watson J. P., Beck C., Howe A. E., Whitley L. D. (2003) Problem difficulty for Tabu search in job-shop scheduling. Artificial Intelligence 143(2): 189\u2013217","journal-title":"Artificial Intelligence"},{"key":"385_CR62","doi-asserted-by":"crossref","unstructured":"Watson, J. P., Howe, A. E., & Whitley, L. D. (2006). Deconstructing Nowicki and Smutnicki\u2019s i-TSAB tabu search algorithm for the job-shop scheduling problem. Computers and Operations Research. doi: 10.1016\/j.cor.2005.07.016 .","DOI":"10.1016\/j.cor.2005.07.016"},{"key":"385_CR63","doi-asserted-by":"crossref","unstructured":"Weckman, G., Ganduri, C., & Koonce, D. (2008). A neural network job-shop scheduler. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-008-0073-9 .","DOI":"10.1007\/s10845-008-0073-9"},{"key":"385_CR64","unstructured":"Wenqi, H., & Aihua, Y. (2004). An improved shifting bottleneck procedure for the job shop scheduling problem. Computers and Operations Research. doi: 10.1016\/S0305-0548(03 )00243-0."},{"key":"385_CR65","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/72.839016","volume":"11","author":"S. Yang","year":"2000","unstructured":"Yang S., Wang D. (2000) Constraint satisfaction adaptive neural network and heuristics combined approach for generalized job shop scheduling. IEEE Trans. on Neural Networks 11: 474\u2013486","journal-title":"IEEE Trans. on Neural Networks"},{"key":"385_CR66","unstructured":"URL: Further explanations about JSSP; October 2009; www.eis.uva.es\/elena\/JSSP ."},{"key":"385_CR67","unstructured":"URL: Further explanations about MMGAs; October 2009; www.eis.uva.es\/elena\/MMGAs ."},{"key":"385_CR68","unstructured":"URL: Optima solutions of la01-la05, mt06, mt10 ad mt20;October 2009; www.eis.uva.es\/elena\/JSSP\/optima.htm ."},{"key":"385_CR69","unstructured":"URL: OR-Library; October 2009; http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html ."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-010-0385-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-010-0385-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-010-0385-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:47Z","timestamp":1559254307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-010-0385-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,7]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s10845-010-0385-4","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,7]]}}}