Abstract
MILP (Mixed Integer Linear Programming) scheduling models for non-sequential multipurpose batch processes are presented. Operation sequences of products have to be made in each unit differently by considering production route of each product under a given intermediate storage policy to reduce idle time of units and to raise the efficiency of the process. We represent the starting and finishing time of a task in each unit with two coordinates for a given storage policy. One is based on products, and the other is based on operation sequences. Then, using binary variables and logical constraints, we match the variables used in the two coordinates into one. We suggest MILP models considering sequence dependent setup times to guarantee the optimality of the solutions. Two examples are presented to show the effectiveness of the suggested models.
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.
