Abstract
The paper presents a novel MILP model for batch plants with parallel lines based on the continuous time domain representation and the notation of time slot. When the model is built, the allocation of batches of products and units to time slots is formulated as two sets of binary variables respectively. This model has less binary variables than any other model based on the idea of time slot, and can accommodate sequence-dependent setup times. The computational examples show that the optimal scheduling can be obtained by solving the MILP model in a reasonably short time, especially when the scheduling problem involving a product with several batches is considered.
Sign-in/Register to access full text options 
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.
