Minimizing the total weighted completion time of deteriorating jobs
The paper deals with a single machine problem of scheduling jobs with start tune dependent processing tithes to minimize the total weighted completion time. The computational complexity of this problem was unknown for ten years. We prove that the problem is NP-hard. (C) 2002 Elsevier Science B.V. All rights reserved.
deteriorating job single machine scheduling computational complexity start time dependent processing time