Two new robust genetic algorithms for the flowshop scheduling problem
- Author
- RUIZ, Rubén1 ; MAROTO, Concepcion1 ; ALCARAZ, Javier1
[1] Departamento de Estadística e Investigación Operativa Aplicadas y Calidad, Universidad Politécnica de Valencia, Edificio 1-3, Camino de Vera S/N, 46021 Valencia, Spain - Source
Omega (Oxford). 2006, Vol 34, Num 5, pp 461-476, 16 p ; ref : 46 ref
- CODEN
- OMEGA6
- ISSN
- 0305-0483
- Scientific domain
- Control theory, operational research
- Publisher
- Elsevier, Exeter
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- Flowshop Genetic algorithms Local search
- Keyword (fr)
- Algorithme génétique Algorithme rapide Algorithme recherche Atelier monogamme Optimisation combinatoire Ordonnancement Plan expérience Recherche locale Recherche tabou Recuit simulé Temps total achèvement
- Keyword (en)
- Genetic algorithm Fast algorithm Search algorithm Flow shop Combinatorial optimization Scheduling Experimental design Local search Tabu search Simulated annealing Makespan
- Keyword (es)
- Algoritmo genético Algoritmo rápido Algoritmo búsqueda Flow shop Optimización combinatoria Reglamento Plan experiencia Busca local Búsqueda tabú Recocido simulado Tiempo total acabamiento
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A13 Inventory control, production control. Distribution
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 17555076
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Install on your browser
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:9:\"\u0000*\u0000jtitle\";s:14:\"Omega (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:12:\"Omega (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"34\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"476\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0483\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"RUIZ\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Rub\u00e9n\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"MAROTO, Concepcion\";i:1;s:15:\"ALCARAZ, Javier\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OMEGA6\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:8:\"\u0000*\u0000place\";s:6:\"Exeter\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:9:\"\u0000*\u0000jtitle\";s:14:\"Omega (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:12:\"Omega (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"34\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"476\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0483\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"RUIZ\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Rub\u00e9n\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"MAROTO, Concepcion\";i:1;s:15:\"ALCARAZ, Javier\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OMEGA6\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:8:\"\u0000*\u0000place\";s:6:\"Exeter\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:9:\"\u0000*\u0000jtitle\";s:14:\"Omega (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:12:\"Omega (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"34\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"476\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0483\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"RUIZ\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Rub\u00e9n\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"MAROTO, Concepcion\";i:1;s:15:\"ALCARAZ, Javier\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OMEGA6\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:8:\"\u0000*\u0000place\";s:6:\"Exeter\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:9:\"\u0000*\u0000jtitle\";s:14:\"Omega (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:12:\"Omega (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"34\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"476\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0483\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"RUIZ\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Rub\u00e9n\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"MAROTO, Concepcion\";i:1;s:15:\"ALCARAZ, Javier\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OMEGA6\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:8:\"\u0000*\u0000place\";s:6:\"Exeter\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:9:\"\u0000*\u0000jtitle\";s:14:\"Omega (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:12:\"Omega (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"34\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"476\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0483\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"RUIZ\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Rub\u00e9n\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"MAROTO, Concepcion\";i:1;s:15:\"ALCARAZ, Javier\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OMEGA6\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"Two new robust genetic algorithms for the flowshop scheduling problem\";s:8:\"\u0000*\u0000place\";s:6:\"Exeter\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
