Repozytorium publikacji - Politechnika Gdańska

A problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct an exact algorithm for the problem. We also consider extending the algorithm to solve problems with precedence constraints and finding all Pareto-optimal solutions. Then we present how to use the concept to the problem 1|pi=a+bisi|sum Ci. We use elimination of dominated partial schedules to improve the efficiency of a branch-and-bound algorithm and present another algorithm, based solely on the elimination of dominated partial schedules.

Autorzy

• dr inż. Krzysztof Ocetkiewicz link otwiera się w nowej karcie