
dr inż. Krzysztof Ocetkiewicz
Zatrudnienie
- Projektant systemów informatycznych w Dział Usług i Aplikacji Informatycznych
Media społecznościowe
Kontakt
- krzocetk@pg.edu.pl
Projektant systemów informatycznych
- Miejsce pracy
- Gmach Elektroniki Telekomunikacji i Informatyki pokój 253
- Telefon
- (58) 347 22 64
Wybrane publikacje
-
A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
In this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J1,…,Jn and the processing time pi of the ith job is given by pi=a+bisi, where si is the starting time of the ith job (i=1,…,n),bi is its deterioration rate and a is the common base processing time. If all jobs have deterioration rates different and not smaller than a certain constant u>0,...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
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...
-
On the independence number of some strong products of cycle-powers
In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish...
wyświetlono 658 razy