Year-end Sale % OFF 
Abstract
This paper addresses the simultaneous lotsizing and scheduling of several products on non-identical parallel production lines (heterogeneous machines). The limited capacity of the production lines may be further reduced by sequence dependent setup times. Deterministic, dynamic demand of standard products has to be met without back-logging with the objective of minimizing sequence dependent setup, holding and production costs.The problem is heuristically solved by combining the local search metastrategies threshold accepting (TA) and simulated annealing (SA), respectively, with dual reoptimization. Such a solution approach has already proved to be successful for the single machine case. The solution quality and computational performance of the new heuristics are tested by means of real-world problems gathered from industry.
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.
