Abstract
A novel algorithm that exploits the strengths of discrete- and continuous-time scheduling mathematical programming formulations is proposed. It consists of three stages, in which (i) an approximate solution is obtained using a discrete-time mixed-integer programming scheduling model, (ii) the solution is mapped onto continuous-time grids via a mapping algorithm, and (iii) the accuracy of the solution is improved by solving a continuous-time linear programming model. Two types of continuous-time grids are introduced, namely unit- and material-specific grids, to ensure feasible unit utilization and material balance in the model. An extensive computational study is performed, showing that the algorithm is capable of finding high quality solutions orders of magnitudes faster than traditional methods.
Original language | English (US) |
---|---|
Pages (from-to) | 838-843 |
Number of pages | 6 |
Journal | IFAC-PapersOnLine |
Volume | 52 |
Issue number | 1 |
DOIs | |
State | Published - 2019 |
Externally published | Yes |
Event | 12th IFAC Symposium on Dynamics and Control of Process Systems, including Biosystems, DYCOPS 2019 - Florianopolis, Brazil Duration: Apr 23 2019 → Apr 26 2019 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
Keywords
- Chemical production scheduling
- Network environment
- Scheduling algorithm
- Solution method