Universiti Teknologi Malaysia Institutional Repository

Genetic-based approaches to predictive-reactive scheduling in flexible manufacturing systems

Zakaria, Zalmiyah and Deris, Safaai and Petrovic, Sanja (2009) Genetic-based approaches to predictive-reactive scheduling in flexible manufacturing systems. In: n/a, 2009, Faculty of Science and Information System, UTM.

Full text not available from this repository.

Official URL: http://comp.utm.my/publications/files/2013/04/Gene...

Abstract

Scheduling plays a vital role in ensuring the effectiveness of the production control of a flexible manufacturing system (FMS). The scheduling problem in advance manufacturing system such as flexible manufacturing system (FMS) is considered as dynamic as new orders may arrive intermittently day-to-day. The newly arrived orders need to be desegregated with the existing production schedule immediately by preserving the efficiency and the stability of the existing schedule. This research focus on addressing the FMS rescheduling problem based on predictive-reactive approach. Constrained chromosomes together with appropriate mutation and crossover are used in order to assist Genetic Algorithms (GA) in providing high performance predictive schedule with minimum computational cost. A good quality schedule is crucial in order to ensure the efficiency and the stability of the existing schedule after rescheduling. Then, reshuffle-based and nonreshuffle-based match-up genetic approaches are used to accommodate new orders by manipulating available idle times on machines and sequencing the operations to the allocated machines, respectively. The efficiency and the stability of the schedules produced by the rescheduling algorithms with different insertion time on the different level of schedule saturation was investigated and compared. Four datasets from two different FMS environments have been used for experiments. The experiments show that the satisfaction grades of the efficiency and the stability of normal orders are higher than rush orders. Based on the observation, we can conclude that the non-reshuffle-based genetic match-up algorithms can be expected to maintain the efficiency and stability of the schedule after rescheduling when new orders arrive.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:kiv record
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:16190
Deposited By: Mrs Liza Porijo
Deposited On:20 Oct 2011 09:48
Last Modified:11 Oct 2017 01:49

Repository Staff Only: item control page