Abstract
This work presents a set of improved MILP mathematical formulations for the scheduling of single-stage batch plants with parallel production lines. Minimization of the average weighted earliness and the makespan, i.e. the time needed to complete all processing tasks, are considered as alternative problem goals. For each objective function an enhanced model that incorporates specific tightening constraints is presented. These constraints improve each model's efficiency by increasing the corresponding objective function lower bound, thus accelerating the branch and bound node pruning process. Several problem instances with different number of batches demonstrate that the proposed approach reduces the computational effort by orders of magnitude. Sequence dependent setup times can also be effectively accommodated.
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.
