Back to Search
Start Over
Combining the advantages of discrete- and continuous-time scheduling models: Part 3. General algorithm.
- Source :
-
Computers & Chemical Engineering . Aug2020, Vol. 139, pN.PAG-N.PAG. 1p. - Publication Year :
- 2020
-
Abstract
- One of the main challenges in applying optimization-based scheduling techniques in process industries stems from the different process characteristics and constraints that need to be taken into account when generating a schedule. For instance, consideration of sequence-dependent changeovers may easily make the resulting optimization model computationally expensive. Accordingly, building upon the recently proposed Discrete-Continuous Algorithm (Lee and Maravelias, 2018), we propose generalized algorithm that enables accurate and fast solution of difficult instances while efficiently handling a wide range of process characteristics. The algorithm combines modeling versatility with computational tractability while guaranteeing the feasibility and accuracy of the final solution. Through a case study inspired by a real-world brewing process, we show that our algorithm provides accurate and high quality solutions to industrial-scale instances in reasonable time. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BREWING
*ALGORITHMS
*PRODUCTION scheduling
Subjects
Details
- Language :
- English
- ISSN :
- 00981354
- Volume :
- 139
- Database :
- Academic Search Index
- Journal :
- Computers & Chemical Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 143767270
- Full Text :
- https://doi.org/10.1016/j.compchemeng.2020.106848