Abstract
The paper deals with a problem of seeking the cyclic schedule with minimal cycle time criterion in a manufacturing system based on the flow of various jobs with identical technological routes, no-wait constraints and some operations missing. We decompose the problem into two sub-problems: finding the minimal cycle time for the given processing order of jobs and finding the optimal processing order of jobs. For the former sub-problem we provide a few alternative methods and analyze their computational complexity. The latter sub-problem is solved by using a metaheuristic. The efficiency and quality of the proposed algorithm were examined experimentally.
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.
