{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:06Z","timestamp":1760707866019},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75514-2_6","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T06:34:24Z","timestamp":1190183664000},"page":"69-81","source":"Crossref","is-referenced-by-count":11,"title":["Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop"],"prefix":"10.1007","author":[{"given":"Geraldo Ribeiro","family":"Filho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo Seido","family":"Nagano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The Complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR2","unstructured":"Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity, and Computations. Nijhoff, The Hahue (1976)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(90)90244-6","volume":"44","author":"R.H. Ahmadi","year":"1990","unstructured":"Ahmadi, R.H., Bagchi, U.: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines. European Journal of Operational Research\u00a044, 331\u2013336 (1990)","journal-title":"European Journal of Operational Research"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/0377-2217(92)90361-C","volume":"61","author":"C. Rajendran","year":"1991","unstructured":"Rajendran, C., Chaudhuri, D.: An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research\u00a061, 318\u2013325 (1991)","journal-title":"European Journal of Operational Research"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0925-5273(93)90024-F","volume":"29","author":"C. Rajendran","year":"1993","unstructured":"Rajendran, C.: Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. International Journal Production Economics\u00a029, 65\u201373 (1993)","journal-title":"International Journal Production Economics"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","volume":"81","author":"J.C. Ho","year":"1995","unstructured":"Ho, J.C.: Flowshop sequencing with mean flowtime objective. European Journal of Operational Research\u00a081, 571\u2013578 (1995)","journal-title":"European Journal of Operational Research"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/0377-2217(95)00347-9","volume":"96","author":"C. Wang","year":"1997","unstructured":"Wang, C., Chu, C., Proth, J.M.: Heuristic approaches for n\/m\/F\/ Ci scheduling problems. European Journal of Operational Research\u00a096, 636\u2013644 (1997)","journal-title":"European Journal of Operational Research"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0305-0548(97)00050-6","volume":"25","author":"D.S. Woo","year":"1998","unstructured":"Woo, D.S., Yim, H.S.: A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research\u00a025, 175\u2013182 (1998)","journal-title":"Computers and Operations Research"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","volume":"132","author":"J. Liu","year":"2001","unstructured":"Liu, J., Reeves, C.R.: Constructive and composite heuristic solutions to the P\/\/\u2009\u2211\u2009C\n                        \n                  i\n                 scheduling problem. European Journal of Operational Research\u00a0132, 439\u2013452 (2001)","journal-title":"European Journal of Operational Research"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0925-5273(01)00228-6","volume":"77","author":"A. Allahverdi","year":"2002","unstructured":"Allahverdi, A., Aldowaisan, T.: New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics\u00a077, 71\u201383 (2002)","journal-title":"International Journal of Production Economics"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"J.M. Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shop. OMEGA\u00a031, 311\u2013317 (2003)","journal-title":"OMEGA"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1016\/j.cor.2003.11.002","volume":"32","author":"J.M. Framinan","year":"2005","unstructured":"Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Comparison of heuristics for flowtime minimisation in permutation flowshops. Computer and Operations Research\u00a032, 1237\u20131254 (2005)","journal-title":"Computer and Operations Research"},{"key":"6_CR13","unstructured":"Li, X., Wang, Q., Wu, C.: Efficient composite heuristics for total flowtime minimization in permutation flow shops. Omega (2006), doi: 10.1016-j.omega.2006.11.003"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Nagano, M.S., Moccellin, J.V.: Reducing mean flow time in permutation flow shop. Journal of the Operational Research Society (2007), doi: 10.1057\/palgrave.jors.2602395","DOI":"10.1057\/palgrave.jors.2602395"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C. Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. European Journal of Operational Research\u00a0155, 426\u2013438 (2004)","journal-title":"European Journal of Operational Research"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"M.F. Tasgetiren","year":"2007","unstructured":"Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research\u00a0177, 1930\u20131947 (2007)","journal-title":"European Journal of Operational Research"},{"key":"6_CR17","unstructured":"Stutzle, T.: Applying iterated local search to the permutation flowshop problem. Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intelletics Group, Darmstad, Germany (1998)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","first-page":"287","volume-title":"Real-World Applications of Evolutionary Computing","author":"D. Merkle","year":"2000","unstructured":"Merkle, D., Middendorf, M.: An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Oates, M.J., Lanzi, P.L., Li, Y., Cagnoni, S., Corne, D.W., Fogarty, T.C., Poli, R., Smith, G.D. (eds.) EvoWorkshops 2000. LNCS, vol.\u00a01803, pp. 287\u2013296. Springer, Heidelberg (2000)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"6_CR20","first-page":"1","volume-title":"Memetic Algorithms in Planning, Scheduling and Timetabling. Evolutionary Schedulling","year":"2006","unstructured":"Cotta, C., Fernandez, A.J.: Memetic Algorithms in Planning, Scheduling and Timetabling. Evolutionary Schedulling, pp. 1\u201330. Springer, Heidelberg (2006)"},{"key":"6_CR21","first-page":"49","volume-title":"Evolutionary Schedulling","author":"M.P. Kleeman","year":"2006","unstructured":"Kleeman, M.P., Lamont, G.B.: Scheduling of flow-shop, job-shop, and combined scheduling problems using MOEAs with fixed and variable length chromosomes. In: Evolutionary Schedulling, pp. 49\u2013100. Springer, Heidelberg (2006)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing\u00a06, 154\u2013160 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","volume":"14","author":"J.P. Watson","year":"2002","unstructured":"Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.: Contrasting structured and random permutation flowshop scheduling problems: Search space topology and algorithm performance. ORSA Journal of Computing\u00a014, 98\u2013123 (2002)","journal-title":"ORSA Journal of Computing"},{"key":"6_CR24","series-title":"LNAI","first-page":"385","volume-title":"Advances in Artificial Intelligence","author":"A.C.M. Oliveira","year":"2004","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) Advances in Artificial Intelligence. LNCS (LNAI), pp. 385\u2013394. Springer, Heidelberg (2004)"},{"key":"6_CR25","series-title":"SCI Series","first-page":"81","volume-title":"Hybrid Evolutionary Systems - Studies in Computational Intelligence","author":"A.C.M. Oliveira","year":"2007","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence. SCI Series, vol.\u00a075, pp. 81\u2013102. Springer, Heidelberg (2007)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA\u00a011, 91\u201395 (1983)","journal-title":"OMEGA"},{"key":"6_CR27","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing: Advances, applications and challenges. In: Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"6_CR28","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: International Conference on Genetic Algorithms (ICGA), Virginia, USA, pp. 2\u20139 (1989)"},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1162\/evco.1998.6.1.25","volume":"6","author":"C. Cotta","year":"1998","unstructured":"Cotta, C., Troya, J.M.: Genetic Forma Recombination in Permutation Flowshop Problems. Evolutionary Computation\u00a06, 25\u201344 (1998)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:22:35Z","timestamp":1619504555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755135"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_6","relation":{},"subject":[]}}