Abstract
Two heuristic algorithms are presented for solving the scheduling problem in a statically loaded Flexible Manufacturing System (FMS). The heuristics goal is to minimise the total cost resulting from the tardiness of jobs. Using the same heuristics, an iterative method is proposed to find an optimal makespan and the average lead time. Modifications required to handle the case of a dynamically loaded FMS are then presented. Simulation results show that the developed heuristics appear to out perform the other published techniques used in obtaining the schedules associated with minimum makespan, minimum average lead time and minimum cost of tardiness. Finally, the simulation of the dynamic case shows that the algorithms could be implemented locally on each station for the scheduling calculation.
Published Version
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 call