A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic
- Author
- CHAOJUN XU1 2 ; SAND, Guido1 ; HARJUNKOSKI, Iiro1 ; ENGELL, Sebastian2
[1] Process and Production Optimization, ABB AG Corporate Research Center Ladenburg, Germany
[2] Process Dynamics and Operations Group, Biochemical and Chemical Engineering, TU Dortmund, Germany - Conference title
- European Symposium of Computer Aided Process Engineering - 21
- Conference name
- European Symposium on Computer-Aided Process Engineering 'ESCAPE-21 (21 ; Chalkidiki 2011-05-29)
- Source
Computers & chemical engineering. 2012, Vol 42, pp 152-167, 16 p ; ref : 3/4 p
- CODEN
- CCENDW
- ISSN
- 0098-1354
- Scientific domain
- Chemical engineering; Computer science
- Publisher
- Elsevier, Kidlington
- Publication country
- United Kingdom
- Document type
- Conference Paper
- Language
- English
- Author keyword
- CPLEX Coordination Horizontal integration Integrated steel production management Large-scale scheduling problems MILP Plant-wide planning and scheduling Production operation
- Keyword (fr)
- Acier Algorithme recherche Appareil étagé Atelier monogamme Coordination Dérivée Echelle grande Etat fondu Gestion intégrée Gestion production Goulot étranglement Modélisation Méthode heuristique Optimisation Ordonnancement discontinu Planification Procédé discontinu Programmation linéaire Programmation mixte Programmation partiellement en nombres entiers
- Keyword (en)
- Steel Search algorithm Multistage apparatus Flow shop Coordination Derivative Large scale Molten state Integrated management Production management Bottleneck Modeling Heuristic method Optimization Batch scheduling Planning Batch process Linear programming Mixed programming Mixed integer programming
- Keyword (es)
- Acero Algoritmo búsqueda Aparato poliescalonado Flow shop Coordinación Derivada Escala grande Estado fundido Gestión integrada Gestión producción Gollete estrangulamiento Modelización Método heurístico Optimización Reglamento discontinuo Planificación Procedimiento discontínuo Programación lineal Programación mixta Programación mixta entera
- Keyword (de)
- Optimierung Planung
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D11 Metals. Metallurgy / 001D11C Production techniques / 001D11C04 Forming / 001D11C04B Rolling
- Discipline
- Metals. Metallurgy
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 26036484
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.compchemeng.2011.12.014 
https://dx.doi.org/10.1016/j.compchemeng.2011.12.014
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:33:\"10.1016\/j.compchemeng.2011.12.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Computers & chemical engineering\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. chem. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"152\";s:8:\"\u0000*\u0000epage\";s:3:\"167\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-1354\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHAOJUN XU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"SAND, Guido\";i:1;s:17:\"HARJUNKOSKI, Iiro\";i:2;s:17:\"ENGELL, Sebastian\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CCENDW\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"European Symposium of Computer Aided Process Engineering - 21\";s:8:\"\u0000*\u0000title\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:33:\"10.1016\/j.compchemeng.2011.12.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Computers & chemical engineering\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. chem. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"152\";s:8:\"\u0000*\u0000epage\";s:3:\"167\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-1354\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHAOJUN XU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"SAND, Guido\";i:1;s:17:\"HARJUNKOSKI, Iiro\";i:2;s:17:\"ENGELL, Sebastian\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CCENDW\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"European Symposium of Computer Aided Process Engineering - 21\";s:8:\"\u0000*\u0000title\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";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:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:33:\"10.1016\/j.compchemeng.2011.12.014\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:33:\"10.1016\/j.compchemeng.2011.12.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Computers & chemical engineering\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. chem. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"152\";s:8:\"\u0000*\u0000epage\";s:3:\"167\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-1354\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHAOJUN XU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"SAND, Guido\";i:1;s:17:\"HARJUNKOSKI, Iiro\";i:2;s:17:\"ENGELL, Sebastian\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CCENDW\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"European Symposium of Computer Aided Process Engineering - 21\";s:8:\"\u0000*\u0000title\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";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:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:33:\"10.1016\/j.compchemeng.2011.12.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Computers & chemical engineering\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. chem. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"42\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"152\";s:8:\"\u0000*\u0000epage\";s:3:\"167\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-1354\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHAOJUN XU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"SAND, Guido\";i:1;s:17:\"HARJUNKOSKI, Iiro\";i:2;s:17:\"ENGELL, Sebastian\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CCENDW\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"European Symposium of Computer Aided Process Engineering - 21\";s:8:\"\u0000*\u0000title\";s:102:\"A new heuristic for plant-wide schedule coordination problems: The intersection coordination heuristic\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";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
