Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

摘要

Recently, the problem of scheduling flowshops with linear deteriorating jobs has attracted the attention of researchers. However, due to the computational complexity, there have been few studies in this class of problems having more than two machines. In this paper, we strive to address this problem considering m-machine case. We deployed a modified simulated annealing algorithm to solve this NP-hard problem in a reasonable computation time. Results obtained from the algorithm are an illustration of its high efficiency.