A neighborhood search algorithm for the unrelated parallel machine scheduling problem

The purpose of this paper is to develop a new neighborhood search algorithm for the studied problem. The remainder of this paper is organized as follows. In Section 2, we give the formal introduction of the studied problem. The proposed neighborhood search algorithm is presented in Section 3. In Sections 4 and 5, we present the computational results and conclusion, respectively.