Abstract
We present a mixed-integer linear programming model for minimizing the makespan of batch processes occurring in the chemical industry. The formulation of the model is based on the starting and processing times of the batches without using an external uniform time grid. A special form for the objective function is chosen and additional redundant constraints are added in order to speed up the solution process. A comparison with the classical uniform time discretization model shows that in many cases the size of the new model as well as its solution time is smaller. Computational results on several instances are reported. The modular structure of the model allows a combination with other continuous-time models for batch processing problems.
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 callDisclaimer: 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.
