Abstract

During the last decade, the problem of production scheduling has been realized to be one of the most important problems in industrial plant operations especially when multipurpose/multiproduct batch processes are involved. This paper presents a novel mathematical formulation for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and results in a mixed integer linear programming (MILP) problem. The novel elements of the proposed formulation are (i) the decoupling of the task events from the unit events, (ii) the time sequencing constraints, and (iii) its linearity. In contrast to the previously presented continuous-time scheduling formulations, the proposed approach leads to smaller and simpler mathematical models which exhibit fewer binary and continuous variables, have smaller integrality gaps, require fewer constraints, need fewer linear programming relaxations, and can be solved in significantly less CPU time. Several examples are presented ...

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.