{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T10:51:05Z","timestamp":1784026265699,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T00:00:00Z","timestamp":1273795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10479-010-0751-9","type":"journal-article","created":{"date-parts":[[2010,5,13]],"date-time":"2010-05-13T11:30:14Z","timestamp":1273750214000},"page":"745-765","source":"Crossref","is-referenced-by-count":67,"title":["A memetic algorithm based on a NSGAII scheme for\u00a0the\u00a0flexible job-shop scheduling problem"],"prefix":"10.1007","volume":"181","author":[{"given":"Mariano","family":"Frutos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ana Carolina","family":"Olivera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fernando","family":"Tohm\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,14]]},"reference":[{"issue":"3","key":"751_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34(3), 391\u2013401.","journal-title":"Management Science"},{"key":"751_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0925-5273(99)00014-6","volume":"63","author":"V. A. Armentano","year":"2000","unstructured":"Armentano, V. A., & Scrich, C. R. (2000). Tabu search for minimizing total tardiness in a job-shop. International Journal of Production Economics, 63, 131\u2013140.","journal-title":"International Journal of Production Economics"},{"key":"751_CR3","first-page":"59","volume-title":"Essays and surveys in meta-heuristics","author":"S. Binato","year":"2001","unstructured":"Binato, S., Hery, W. J., Loewenstern, D. M., & Resende, M. G. C. (2001). A GRASP for job-shop scheduling. In Ribeiro, C. C., & Hansen, P. (Eds.), Essays and surveys in meta-heuristics (pp. 59\u201380). Boston: Kluwer Academic."},{"issue":"4","key":"751_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/09537289208919409","volume":"3","author":"A. Bolat","year":"1992","unstructured":"Bolat, A., & Yano, C. (1992). Scheduling algorithms to minimize utility work at a single station on paced assembly line. Production Planning and Control, 3(4), 393\u2013405.","journal-title":"Production Planning and Control"},{"key":"751_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1018934507395","volume":"70","author":"C. C. Cheng","year":"1997","unstructured":"Cheng, C. C., & Smith, S. F. (1997). Applyng constraint satisfaction techniques to job-shop scheduling. Annals of Operations Research, 70, 327\u2013357.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"751_CR6","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R. Cheng","year":"1996","unstructured":"Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms. Part I: representation. Computers and Industrial Engineering, 30(4), 983\u2013997.","journal-title":"Computers and Industrial Engineering"},{"key":"751_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"C. A. Coello Coello","year":"2002","unstructured":"Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002). Evolutionary algorithms for solving multi-objective problems. New York: Kluwer Academic."},{"key":"751_CR8","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Proceeding second international conference on artificial immune systems","author":"D. Cort\u00e9s Rivera","year":"2003","unstructured":"Cort\u00e9s Rivera, D., Coello Coello, C. A., & Cort\u00e9s, N. C. (2003). Use of an artificial immune system for job-shop scheduling. In Lecture notes in computer science: Vol.\u00a02787. Proceeding second international conference on artificial immune systems. (pp. 1\u201310). Berlin: Springer."},{"key":"751_CR9","unstructured":"Cort\u00e9s Rivera, D., Coello Coello, C. A., & Cort\u00e9s, N. C. (2004). Job-shop scheduling using the clonal selection principle. In ACDM\u20192004, UK."},{"key":"751_CR10","unstructured":"Crawford, J. M., & Baker, A. B. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. Computational Intelligence Research Laboratory."},{"issue":"2","key":"751_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multi-objective genetic algorithm: NSGAII. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"751_CR12","volume-title":"The selfish gene","author":"R. Dawkins","year":"2006","unstructured":"Dawkins, R. (2006). The selfish gene, 3rd edn. Oxford: Oxford University Press.","edition":"3"},{"key":"751_CR13","volume-title":"Simulated annealing, modern heuristic techniques for combinatorial problems","author":"K. A. Dowsland","year":"1993","unstructured":"Dowsland, K. A. (1993). In C. R. Reeves (Ed.), Simulated annealing, modern heuristic techniques for combinatorial problems. Oxford: Blackwell Sci.."},{"key":"751_CR14","unstructured":"Frutos, M., & Olivera, A. C. (2008). Job shop scheduling problem: desarrollo de un procedimiento eficiente. In Proceeding XIV congreso Latino-Ibero-Americano en investigaci\u00f3n de operaciones, Colombia."},{"key":"751_CR15","unstructured":"Frutos, M., & Tohm\u00e9, F. (2009). Desarrollo de un procedimiento gen\u00e9tico dise\u00f1ado para programar la producci\u00f3n en un sistema de manufactura tipo job-shop. In Proceeding VI congreso espa\u00f1ol sobre meta-heur\u00edsticas, algoritmos evolutivos y bioinspirados, M\u00e1laga."},{"key":"751_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"C. D. Gelatt","year":"1983","unstructured":"Gelatt, C. D., Kirkpatrick, S., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"751_CR17","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. Readings: Addison-Wesley."},{"issue":"2","key":"751_CR18","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1016\/j.amc.2006.09.023","volume":"187","author":"J. Heinonen","year":"2007","unstructured":"Heinonen, J., & Pettersson, F. (2007). Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Applied Mathematics and Computation, 187(2), 989\u2013998.","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"751_CR19","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H. Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Yoshida, T., & Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling. IEEE Transactions on Evolutionary Computation, 7(2), 204\u2013223.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"14","key":"751_CR20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A. Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A. (2004). A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operations Research, 131(14), 135\u2013158.","journal-title":"Annals of Operations Research"},{"key":"751_CR21","doi-asserted-by":"crossref","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2001). Approach by localization and genetic manipulations algorithm for flexible job-shop problems. In Proceedings of the international IEEE conference on systems, man, and cybernetics. Tucson, AZ, USA (pp.\u00a0599\u20132604).","DOI":"10.1109\/ICSMC.2001.972955"},{"key":"751_CR22","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. (2002). Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems Man and Cybernetics, 32, 1\u201313.","journal-title":"IEEE Transactions on Systems Man and Cybernetics"},{"key":"751_CR23","unstructured":"Larraz\u00e1bal, M. C. (2003). Configuraci\u00f3n de sistemas de producci\u00f3n, optimizaci\u00f3n basada en simulaci\u00f3n. Memoria de T\u00edtulo, Universidad de Concepci\u00f3n, Chile."},{"key":"751_CR24","doi-asserted-by":"crossref","unstructured":"Merkle, D., & Middendorf, M. (2001). A new approach to solve permutation scheduling problems with ant colony optimization. In Applications of evolutionary computing (Vol.\u00a02037, pp.\u00a0484\u2013494), EvoWorkshops 2001, proceedings.","DOI":"10.1007\/3-540-45365-2_50"},{"key":"751_CR25","first-page":"322","volume":"28","author":"M. Mollaghasemi","year":"1998","unstructured":"Mollaghasemi, M., Le-Croy, K., & Georgiopoulus, M. (1998). Application of neural networks and simulation. Modeling in Manufacturing System Design. Interfaces, 28, 322\u2013326.","journal-title":"Modeling in Manufacturing System Design. Interfaces"},{"key":"751_CR26","volume-title":"Computational complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H. (1994). Computational complexity. Readings: Addison-Wesley."},{"issue":"4","key":"751_CR27","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"B. J. Park","year":"2003","unstructured":"Park, B. J., Choi, H. R., & Kim, H. S. A. (2003). Hybrid genetic algorithm for the job-shop scheduling problems. Computers and Industrial Engineering, 45(4), 597\u2013613.","journal-title":"Computers and Industrial Engineering"},{"key":"751_CR28","volume-title":"Scheduling theory, algorithms and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling theory, algorithms and systems. New York: Prentice Hall."},{"key":"751_CR29","doi-asserted-by":"crossref","unstructured":"Sadeh, N. M., & Fox, M. S. (1995). Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem. Technical report CMU-RI-TR-95-39. Appear in the Artificial Intelligence Journal.","DOI":"10.21236\/ADA311303"},{"key":"751_CR30","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R. H. Storer","year":"1992","unstructured":"Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing instances with application to job-shop scheduling. Management Science, 38, 1495\u20131509.","journal-title":"Management Science"},{"key":"751_CR31","unstructured":"Tsai, C. F., & Lin, F. C. (2003). A new hybrid heuristic technique for solving job-shop scheduling problem. In Intelligent data acquisition and advanced computing systems: technology and applications. Second IEEE international workshop."},{"key":"751_CR32","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J. D. Ullman","year":"1975","unstructured":"Ullman, J. D. (1975). Np-complete scheduling problems. Journal of Computer System Sciences, 10, 384\u2013393.","journal-title":"Journal of Computer System Sciences"},{"key":"751_CR33","doi-asserted-by":"crossref","unstructured":"Wu, C. G., Xing, X.L., Lee, H. P., Zhou, C. G., & Liang, Y. C. (2004). Genetic algorithm application on the job-shop scheduling problem. In Machine learning and cybernetics (Vol.\u00a04, pp.\u00a02102\u20132106). Proceedings of 2004 international conference.","DOI":"10.1109\/ICMLC.2004.1382144"},{"key":"751_CR34","doi-asserted-by":"crossref","DOI":"10.1049\/PBCE055E","volume-title":"Genetic algorithms in engineering systems","author":"A. M. S. Zalzala","year":"1997","unstructured":"Zalzala, A. M. S., & Flemming, P. J. (1997). Genetic algorithms in engineering systems. London: London Institution of Electrical Engineers."},{"key":"751_CR35","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44719-9","volume-title":"Evolutionary multi-criterion optimization","author":"E. Zitzler","year":"2001","unstructured":"Zitzler, E., Deb, K., Thiele, L., Coello Coello, C. A., & Corne, D. (2001). Evolutionary multi-criterion optimization. Lecture notes in computer science: Vol.\u00a01993. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0751-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0751-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0751-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:01Z","timestamp":1559153281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0751-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,14]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0751-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,14]]}}}