Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems
- Author
- LIN, S.-W1 ; YING, K.-C2
[1] Department of Information Management, Huafan University, Taipei, Taiwan, Province of China
[2] Department of Industrial Management and Management Information, Huafan University, Taipei, Taiwan, Province of China - Source
International journal of production research. 2009, Vol 47, Num 5, pp 1411-1424, 14 p ; ref : 1 p.1/4
- CODEN
- IJPRB8
- ISSN
- 0020-7543
- Scientific domain
- Control theory, operational research
- Publisher
- Taylor & Francis, Abingdon
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- hybrid approach non-permutation flowshop scheduling simulated annealing tabu search
- Keyword (fr)
- Atelier monogamme Borne supérieure Fonction objectif Intelligence en essaim Ordonnancement Permutation Recherche tabou Recuit simulé Temps achèvement Temps total achèvement
- Keyword (en)
- Flow shop Upper bound Objective function Swarm intelligence Scheduling Permutation Tabu search Simulated annealing Completion time Makespan
- Keyword (es)
- Flow shop Cota superior Función objetivo Inteligencia de enjambre Reglamento Permutación Búsqueda tabú Recocido simulado Tiempo acabado Tiempo total acabamiento
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming
- 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
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21145880
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.1080/00207540701484939 
https://dx.doi.org/10.1080/00207540701484939
"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:25:\"10.1080\/00207540701484939\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:9:\"\u0000*\u0000jtitle\";s:44:\"International journal of production research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Int. j. prod. res\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:4:\"1411\";s:8:\"\u0000*\u0000epage\";s:4:\"1424\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7543\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"LIN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S.-W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"YING, K.-C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJPRB8\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:25:\"10.1080\/00207540701484939\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:9:\"\u0000*\u0000jtitle\";s:44:\"International journal of production research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Int. j. prod. res\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:4:\"1411\";s:8:\"\u0000*\u0000epage\";s:4:\"1424\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7543\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"LIN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S.-W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"YING, K.-C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJPRB8\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:25:\"10.1080\/00207540701484939\";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:25:\"10.1080\/00207540701484939\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:9:\"\u0000*\u0000jtitle\";s:44:\"International journal of production research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Int. j. prod. res\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:4:\"1411\";s:8:\"\u0000*\u0000epage\";s:4:\"1424\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7543\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"LIN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S.-W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"YING, K.-C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJPRB8\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:25:\"10.1080\/00207540701484939\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:9:\"\u0000*\u0000jtitle\";s:44:\"International journal of production research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Int. j. prod. res\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:4:\"1411\";s:8:\"\u0000*\u0000epage\";s:4:\"1424\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7543\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"LIN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S.-W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"YING, K.-C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJPRB8\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:25:\"10.1080\/00207540701484939\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:9:\"\u0000*\u0000jtitle\";s:44:\"International journal of production research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Int. j. prod. res\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:4:\"1411\";s:8:\"\u0000*\u0000epage\";s:4:\"1424\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7543\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"LIN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S.-W\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"YING, K.-C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJPRB8\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:16:\"Taylor & Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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
