Genetic algorithms for match-up rescheduling of the flexible manufacturing systems

► Rescheduling methods based on genetic algorithms to address arrivals of new orders. ► Genetic algorithms for match-up rescheduling with non-reshuffle strategy. ► Genetic algorithms for match-up rescheduling with reshuffle strategy. ► Non-reshuffle strategy manipulates the idle timeslots to assign new orders. ► Reshuffle strategy re-sequences the operations to accommodate new orders. Scheduling plays a vital role in ensuring the effectiveness of the production control of a flexible manufacturing system (FMS). The scheduling problem in FMS is considered to be dynamic in its nature as new orders may arrive every day. The new orders need to be integrated with the existing production schedule immediately without disturbing the performance and the stability of existing schedule. Most FMS scheduling methods reported in the literature address the static FMS scheduling problems. In this paper, rescheduling methods based on genetic algorithms are described to address arrivals of new orders. This study proposes genetic algorithms for match-up rescheduling with non-reshuffle and reshuffle strategies which accommodate new orders by manipulating the available idle times on machines and by resequencing operations, respectively. The basic idea of the match-up approach is to modify only a part of the initial schedule and to develop genetic algorithms (GAs) to generate a solution within the rescheduling horizon in such a way that both the stability and performance of the shop floor are kept. The proposed non-reshuffle and reshuffle strategies have been evaluated and the results have been compared with the total-rescheduling method.