Abstract
A new concept of time decomposition which allows to combine linear programming and heuristics to solve the dynamic problem of job distribution on machine tools for a scheduling horizon is presented. An optimization algorithm based on this decomposition principle and which considers also the setup times is described. The application of the algorithm is demonstrated on a case of multiple-operation jobs processed according to the arrival and due date schedule, on machine tools grouped in sections according to operations. The results indicate, that the optimization based on the concept of time decomposition into constant job-mix stages. CMS, leads to increased utilization of machine tools, higher production rate in sections, with shorter makespan of individual jobs and reduced computational time.
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.
