INVERSE SCHEDULING IN FLOWSHOP WITH MULTIPLE MACHINES

In order to meet market requirements, operations to be performed with optimal sequence in scheduling systems and should allow enough flexibility against uncertain events to a specific objective. Traditional schedule will not address all these issues. In this paper, the inverse scheduling for multi machine flow shop with make span as objective is illustrated. Meta heuristics are applied to solve the problem six instances are adopted to verify the effectiveness of the proposed algorithm.