摘要

The due date assignment has become a challenging issue related to the interaction between various participants of the supply chain. In this paper, we consider the total earliness and tardiness penalty scheduling simultaneously with the deterioration effects and maintenance activities on an unrelated parallel machine setting. We aim to determine jointly the optimal maintenance activity positions, the optimal common due date for all the jobs, and the optimal schedule to minimize the sum of the earliness and tardiness costs. If the number of machines is fixed, we introduce a polynomial time algorithm for solving the problem. We also propose an efficient polynomial time algorithm with a lower order time complexity for finding the optimal solution of a special case of the problem.