Abstract
Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flow shop scheduling problem in smart manufacturing system. In this problem, jobs need to be transported by transporters like AGV (Automated Guided Vehicle) to next stage after processing. During transportation, waiting time dynamically occurs for both jobs and transporters, and finally contributes to makespan. The waiting times are conditioned by buffer capacity, machine allocations and production sequence. In order to minimize makespan with consideration of dynamic waiting times, we proposed a waiting time calculation approach to evaluate waiting time and makespan. This approach considers two situations: infinite buffer capacity and zero buffer capacity. Further, we developed a memetic algorithm integrated with waiting time calculation approach to solve FFSPDW. Finally, we verified the algorithm parameters via analysis of variance. Computational results show that the proposed memetic algorithm is able to reach high quality solutions with short computation time. Consequently, the proposed approach is suitable for solving industrial FFSPDW problems.
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.
