ABSTRACT
ABSTRACT: In this paper, the unrelated parallel machine scheduling problem with machine eligibility restrictions is studied with the objective of minimizing the maximum makespan. A new neighborhood search algorithm is proposed to find a near optimal solution, which is based on insertion and swap moves. An efficient method is developed to find a feasible swap move. We present computational results for a set of randomly generated instances. The results show that the proposed algorithm outperforms simple heuristics with respect to solution quality.
