A dynamic approach of using dispatching rules in scheduling

Manufacturing system in reality has dynamic nature due to certain unexpected events occur in changing environment,which requires rescheduling. this does not mean that every decision is made in real time. based on the state of the working environment,determining best rule at right time is one of the alternatives. this study focuses on selecting the dispatching rule that show best performance dynamically both in static and changing environment. simulation is carried out by employing genetic algorithm on flow-shop and job-shop scheduling problems to compare the performance of the dispatching rules dynamically. out of many rules proposed in the past,it has been observed that under certain conditions,the spt (shortest processing time) performs best in both the environment,when the total processing time of a job is not high relatively. © 2016 penerbit utm press. all rights reserved.