Abstract
During the last two decades, the problem of short-term scheduling of multiporuct and multipurpose batch plants has gianed increasing attention in the academic, research and manufacturing communities, predominantly because of the challenges and the high economic incentives involved. In the last ten years, numerous formulations have been proposed in the literature based on continuous representations of time. These continuous-time formulations have proliferated due to their established advantages over discrete-time representations and are often compared with one another in terms of computational complexity. the various continuous-time models can be broadly classified into three distinct categories: slot based, global-event based, and unit-specific-event based formulations. In this paper, we compare and evaluate the performance of these models, based on our implementations, using a benchmark example problem from the literature. Two different objective functions: maximization of profit and minimization of makespan are considered.
Original language | English |
---|---|
Pages (from-to) | 1923-1928 |
Number of pages | 6 |
Journal | Computer Aided Chemical Engineering |
Volume | 21 |
Issue number | C |
DOIs | |
Publication status | Published - 2006 |
Externally published | Yes |
Keywords
- continuous-time model
- mixed-integer linear programming
- multiproduct batch plants
- multipurpose batch plants
- short-term scheduling
ASJC Scopus subject areas
- Chemical Engineering(all)
- Computer Science Applications