Scheduling of Flexible Manufacturing Systems Considering Maintenance

Scheduling of flexible manufacturing systems is one of problems in NP-Hard optimization. The aim of scheduling of these systems is to maximize the system efficiency by finding an optimal planning for a better cooperation among various processes. In recent years many algorithms proposed to solve this problem, and most of them are based on heuristic methods. In This paper we have proposed a new algorithm namely MTPN, a Memetic algorithm combined with Timed Petri Net, for scheduling flexible manufacturing systems considering maintenance problem. The experimental results show that our proposed algorithm, i.e. MTPN has about %6.73 and %23.82 improvements over GADG and PN-GA algorithms respectively.