AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY
- Author
- HUANG, X. W1 ; ZHAO, X. Y1 ; MA, X. L1
[1] Faculty of Management and Economics, Dalian University of Technology, Dalian, China - Source
International journal of simulation modelling. 2014, Vol 13, Num 4, pp 510-522, 13 p ; ref : 31 ref
- ISSN
- 1726-4529
- Scientific domain
- Computer science
- Publisher
- DAAAM International Vienna, Vienna
- Publication country
- Austria
- Document type
- Article
- Language
- English
- Author keyword
- Genetic Algorithm Job Shop Scheduling Process Sequence Flexibility
- Keyword (fr)
- Algorithme génétique Atelier flexible Atelier multigamme Charge travail Chromosome Codage Conception ingénierie Flexibilité Gestion tâche Mutation Ordonnancement Palier Temps total achèvement
- Keyword (en)
- Genetic algorithm Flexible manufacturing system Job shop Workload Chromosome Coding Engineering design Flexibility Task scheduling Mutation Scheduling Bearing(mechanics) Makespan
- Keyword (es)
- Algoritmo genético Sistema flexible producción Job shop Carga trabajo Cromosoma Codificación Concepción ingeniería Flexibilidad Gestión labor Mutación Reglamento Descansillo Tiempo total acabamiento
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A12 Scheduling, sequencing
- 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
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D12 Mechanical engineering. Machine design / 001D12E Drives / 001D12E03 Bearings, bushings, rolling bearings
- Discipline
- Mechanical engineering. Mechanical construction. Handling Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 29032153
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
Access to the document
Install on your browser
DOI
10.2507/IJSIMM13(4)CO20 
https://dx.doi.org/10.2507/IJSIMM13(4)CO20
"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:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of simulation modelling\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. simul. model\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"510\";s:8:\"\u0000*\u0000epage\";s:3:\"522\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1726-4529\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HUANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"X. W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"ZHAO, X. Y\";i:1;s:8:\"MA, X. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:8:\"\u0000*\u0000place\";s:6:\"Vienna\";s:6:\"\u0000*\u0000pub\";s:26:\"DAAAM International Vienna\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of simulation modelling\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. simul. model\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"510\";s:8:\"\u0000*\u0000epage\";s:3:\"522\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1726-4529\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HUANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"X. W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"ZHAO, X. Y\";i:1;s:8:\"MA, X. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:8:\"\u0000*\u0000place\";s:6:\"Vienna\";s:6:\"\u0000*\u0000pub\";s:26:\"DAAAM International Vienna\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of simulation modelling\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. simul. model\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"510\";s:8:\"\u0000*\u0000epage\";s:3:\"522\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1726-4529\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HUANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"X. W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"ZHAO, X. Y\";i:1;s:8:\"MA, X. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:8:\"\u0000*\u0000place\";s:6:\"Vienna\";s:6:\"\u0000*\u0000pub\";s:26:\"DAAAM International Vienna\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of simulation modelling\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. simul. model\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"510\";s:8:\"\u0000*\u0000epage\";s:3:\"522\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1726-4529\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HUANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"X. W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"ZHAO, X. Y\";i:1;s:8:\"MA, X. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:8:\"\u0000*\u0000place\";s:6:\"Vienna\";s:6:\"\u0000*\u0000pub\";s:26:\"DAAAM International Vienna\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:23:\"10.2507\/IJSIMM13(4)CO20\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of simulation modelling\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. simul. model\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"510\";s:8:\"\u0000*\u0000epage\";s:3:\"522\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1726-4529\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HUANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"X. W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"ZHAO, X. Y\";i:1;s:8:\"MA, X. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY\";s:8:\"\u0000*\u0000place\";s:6:\"Vienna\";s:6:\"\u0000*\u0000pub\";s:26:\"DAAAM International Vienna\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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
