Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
In the paper two problems of a single machine bicriterion scheduling of a set of deteriorating jobs are considered. The jobs are independent, nonpreemptable and are ready for processing at time 0 0 . The processing time pj p j of each job is a linear function of the starting time Sj S j of the job, pj=1+?jSj p j = 1 + ? j S j , where Sj?0 S j ? 0 and ?j>0 ? j > 0 for j=0,1,...,n j = 0 , 1 ,..., n . The first problem is to find a schedule which is Pareto optimal with respect to ?Cj ? C j and Cmax C max criteria. The second problem is to find an optimal schedule subject to the minimization of the criterion in the form of ??Cj+ ? ? C j + (1-?)Cmax ( 1 - ? ) C max , where ??[0,1] ? ? [ 0 , 1 ] . There are given necessary and sufficient conditions for a schedule to be Pareto optimal for the first problem. It is proved that there exists 0<?0<1 0 < ? 0 < 1 such that for all ??[0,?0] ? ? [ 0 , ? 0 ] the second problem is solvable in O ( n log n ) time. It is also proved that an optimal schedule for the second problem has a V-shape for all ??[?1,1] ? ? [ ? 1 , 1 ] , where ?0<?1<1 ? 0 < ? 1 < 1 . Time-dependent scheduling and bicriterion scheduling are today subjects of intensive research. The main motivation for studying such problems is the important role they play in many applications. In the paper we consider two problems of a single machine bicriterion scheduling of a set of deteriorating jobs. The processing time of each job is a linear function of the starting time of the job. The first problem is to find a Pareto optimal schedule with respect to the total completion time and the maximum completion time criteria. The second problem is to minimize a convex combination of the above two criteria. We give necessary and sufficient conditions for a schedule to be Pareto optimal for the first problem and prove several theorems concerning the form of an optimal schedule for the second problem.
deteriorating jobs single machine bicriterion scheduling pareto optimality total completion time maximum completion time