Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

Abstract

In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight‐combination search algorithm and a variable neighborhood search are employed to yield optimal or near‐optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near‐optimal solutions in a reasonable computational time even for large‐sized problems.