Abstract
In this paper, a cyclic scheduling problem in a flow-shop network including a robot and several machines is studied. The cyclic scheduling problem deals with the planning of operations that have to be repeated in a timely fashion infinitely often. Obtaining the optimal schedule is an NP-hard problem in general. It is proven that the optimal schedule is always among a limited number of schedules known as 1-unit cycles for up to three machines in a flow-shop network. This paper proves that the optimal cycle is a 1-unit cycle for an arbitrary number of machines.
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.
