Repozytorium publikacji - Politechnika Gdańska

In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then an optimal schedule can be found in O(n log n) time. Moreover, the conducted computational experiments show that the presented algorithm performs very well even on data not meeting the given constraints.

Autorzy

• prof. dr hab. inż. Marek Kubale link otwiera się w nowej karcie ,
• dr inż. Krzysztof Ocetkiewicz link otwiera się w nowej karcie