
dr inż. Krzysztof Ocetkiewicz
Zatrudnienie
- Projektant systemów informatycznych w Dział Usług Chmurowych
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,...
-
Optimization of parallel implementation of UNRES package for coarse‐grained simulations to treat large proteins
We report major algorithmic improvements of the UNRES package for physics-based coarse-grained simulations of proteins. These include (i) introduction of interaction lists to optimize computations, (ii) transforming the inertia matrix to a pentadiagonal form to reduce computing and memory requirements, (iii) removing explicit angles and dihedral angles from energy expressions and recoding the most time-consuming energy/force terms...
-
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...
wyświetlono 1422 razy