Abstract
In the contemporary industrial production, multiple resource constraints and uncertainty factors exist widely in the actual job shop. It is particularly important to make a reasonable scheduling scheme in workshop manufacturing. Traditional scheduling research focused on the one-time global optimization of production scheduling before the actual production. The dynamic scheduling problem of the workshop is getting more and more attention. This paper proposed a simulated annealing algorithm to solve the real-time scheduling problem of large variety and low-volume mixed model assembly line. This algorithm obtains three groups of optimal solutions and the optimal scheduling scheme of multiple products, with the shortest product completion time and the lowest cost. Finally, the feasibility and efficiency of the model are proved by the Matlab simulation.
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.
