SCHEDULING HYBRID FLEXIBLE FLOW SHOP WITH SEQUENCE DEPENDENT SETUP TIMES AND MACHINE AVAILABILITY CONSTRAINTS

In this work, we consider hybrid flexible flow shop with sequence setup times and machine availability constraints which few works are done in this field. The main aim is to utilize available limited sources in production horizon time, so that researches about these subjects in real world seem essential work. The purpose of preventive maintenance is to avoid failure or breakdown before occurrence or to decline the failure or breakdown probability. In this matter, we propose six heuristic algorithms (SMPT, LMPT, Johnson, CDS, MNEH) and compare them with each other in different sizes of sample problems to optimize the makespan (Cmax) for hybrid flexible flow shop with sequence dependent setup time and preventive maintenance operations that can prove the validation of algorithms. The results show that performance evaluation of our proposal is effective and suitable to solve such problems.

Keywords:

hybrid flexible flow shop , dependent setup time , machine availability constraints , heuristic