Supply chain scheduling with deteriorating jobs and delivery times
摘要
This paper discusses the single-machine scheduling problems with deteriorating jobs and past-sequence-dependent delivery times. Under the general deterioration function, the objective is to determine an optimal schedule for the job that minimizes the makespan, and the total weighted completion time. We demonstrate that the makespan minimization is polynomially solvable. For the total weighted completion time, this problem is NP-hard, to solve this problem, we provide the branch-and-bound algorithm and some heuristic algorithms.