Heuristic Approaches To Fms Scheduling Problems

Abstract

The recent manufacturing environment is characterized by a wide variety of products shorter lead times to delivery minimum production cost maximum return on investment and maintaining standards of quality Manufacturing systems should be able to adapt quickly and efficiently to varying market demands that make changes in objectives and operative environment The new automated production systems such as Flexible Manufacturing System FMS are capable of producing wide variety of products through the combination of flexibility integration and automation As more FMS went into industrial operation the research work on FMS operational issues gained greater momentum The research works on FMS scheduling has received more attention for the past 30 years because reducing lead time is the goal for industries This research mainly aims at increasing the efficiency of job shop type FMS environment through scheduling concepts The following problem instances are considered in this research work The simultaneous scheduling problem considering machines and tools in a multi machine FMS to generate best optimal sequences that minimizes makespan is proposed Four heuristics namely priority dispatching rules modified nondelay schedule generation algorithm with six priority dispatching rules modified Giffler and Thompson algorithm and artificial immune system algorithm have been suggested for solving combined machine and tool scheduling problem The proposed heuristics are numerically tested on randomly generated problems and the results are compared AIS algorithm yields better results than other heuristics newline newline