Abstract
Many studies on scheduling problems assume that each machine is used exclusively for one operation and disregard machine setup time. This exploration studies two-machine flow-shop scheduling problems in which both machines are versatile and setup time is considered. First, a modified optimal algorithm for determining the optimal schedule is developed to minimize the makespan of jobs for these problems. Second, a genetic algorithm is used to quickly find near-optimal schedules for large scale problems. Finally, computational experiments are performed to illustrate the effectiveness and efficiency of the proposed algorithms.
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.
