A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling
- Author
- TASGETIREN, M. Fatih1 ; LIANG, Yun-Chia2 ; SEVKLI, Mehmet3 ; GENCYILMAZ, Gunes4
[1] Department of Management, Fatih University, 34500 Buyukcekmece, Istanbul, Turkey
[2] Department of Industrial Engineering and Management, Yuan Ze University, No. 135 Yuan-Tung Road, Chung-Li, Taoyuan County, 320, Taiwan, Province of China
[3] Department of Industrial Engineering, Fatih University, 34500 Buyukcekmece, Istanbul, Turkey
[4] Department of Management, Istanbul Kultur University, E5 Karayolu Uzeri, Sirinevler, Istanbul, Turkey - Source
European journal of operational research. 2007, Vol 177, Num 3, pp 1930-1947, 18 p ; ref : 58 ref
- CODEN
- EJORDT
- ISSN
- 0377-2217
- Scientific domain
- Control theory, operational research
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Makespan Particle swarm optimization Permutation flowshop Scheduling Total flowtime Variable neighborhood search
- Keyword (fr)
- Algorithme génétique Algorithme évolutionniste Atelier monogamme Critère qualité Minimisation Méthode heuristique Optimisation essaim particule Ordonnancement Permutation Problème recherche Recherche locale Séquençage Temps total achèvement Topologie
- Keyword (en)
- Genetic algorithm Evolutionary algorithm Flow shop Quality criterion Minimization Heuristic method Swarm intelligence Scheduling Permutation Search problem Local search Sequencing Makespan Topology
- Keyword (es)
- Algoritmo genético Algoritmo evoluciónista Flow shop Criterio calidad Minimización Método heurístico Optimización enjambre partícula Reglamento Permutación Problema investigación Busca local Sequencing Tiempo total acabamiento Topología
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A12 Scheduling, sequencing
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18411023
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.1016/j.ejor.2005.12.024 
https://dx.doi.org/10.1016/j.ejor.2005.12.024
"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:26:\"10.1016\/j.ejor.2005.12.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"177\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1930\";s:8:\"\u0000*\u0000epage\";s:4:\"1947\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"TASGETIREN\";s:10:\"\u0000*\u0000aufirst\";s:8:\"M. Fatih\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"LIANG, Yun-Chia\";i:1;s:14:\"SEVKLI, Mehmet\";i:2;s:17:\"GENCYILMAZ, Gunes\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.ejor.2005.12.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"177\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1930\";s:8:\"\u0000*\u0000epage\";s:4:\"1947\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"TASGETIREN\";s:10:\"\u0000*\u0000aufirst\";s:8:\"M. Fatih\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"LIANG, Yun-Chia\";i:1;s:14:\"SEVKLI, Mehmet\";i:2;s:17:\"GENCYILMAZ, Gunes\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.ejor.2005.12.024\";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:26:\"10.1016\/j.ejor.2005.12.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"177\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1930\";s:8:\"\u0000*\u0000epage\";s:4:\"1947\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"TASGETIREN\";s:10:\"\u0000*\u0000aufirst\";s:8:\"M. Fatih\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"LIANG, Yun-Chia\";i:1;s:14:\"SEVKLI, Mehmet\";i:2;s:17:\"GENCYILMAZ, Gunes\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.ejor.2005.12.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"177\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1930\";s:8:\"\u0000*\u0000epage\";s:4:\"1947\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"TASGETIREN\";s:10:\"\u0000*\u0000aufirst\";s:8:\"M. Fatih\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"LIANG, Yun-Chia\";i:1;s:14:\"SEVKLI, Mehmet\";i:2;s:17:\"GENCYILMAZ, Gunes\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.ejor.2005.12.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"177\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1930\";s:8:\"\u0000*\u0000epage\";s:4:\"1947\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"TASGETIREN\";s:10:\"\u0000*\u0000aufirst\";s:8:\"M. Fatih\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"LIANG, Yun-Chia\";i:1;s:14:\"SEVKLI, Mehmet\";i:2;s:17:\"GENCYILMAZ, Gunes\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:176:\"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem : Evolutionary and meta-heuristic scheduling\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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
