Abstract
This study considers a new flow shop scheduling problem with synchronous material movement. Specifically, we consider an automated machining centre that consists of a loading/unloading station, two CNC machining stations, and a material handling device. The material handling device is a rotary table that moves jobs between stations simultaneously. Given a set of jobs that need to be processed in the machining centre, the objective of the problem is to find the sequence that minimises the makespan. This problem can be shown to be NP-hard in the strong sense. A dynamic programming algorithm is proposed to obtain an optimal sequence for small- and medium- size problems. For large-scale problems, two heuristic algorithms are developed to obtain a near-optimal solution in a short time. Computational results for the proposed algorithms are provided.
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.
