An effective heuristic considering machine flexibility for parallel machine with eligibility problem

Parallel machine with eligibility scheduling problem is commonly seen in manufacturing industries such as semi-conductor manufacturing. This paper takes flexibility concept into consideration and develops a novel heuristic algorithm to minimize makespan of the problem. Mathematical model is developed as an effectiveness comparison to this algorithm. Data test uses random generated problem with given parameters, and the result shows that proposed algorithm can achieve very close or exact solution to optimality.