Buscar
Mostrando ítems 1-10 de 3391
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
(Elsevier, 2016)
We study scheduling problems when jobs can be split and a setup is required before processing each part, to minimize the weighted sum of completion times. Using a simple splitting strategy and a reduction to an orders ...
Optimal algorithms for scheduling under time-of-use tariffs
(Springer, 2021)
© 2021, The Author(s).We consider a natural generalization of classical scheduling problems to a setting in which using a time unit for processing a job causes some time-dependent cost, the time-of-use tariff, which must ...
Performance guarantees of local search for minsum scheduling problems
(Springer, 2020)
We study the worst-case performance guarantee of locally optimal solutions for the problem of minimizing the total weighted and unweighted completion time on parallel machine environments. Our method makes use of a mapping ...
Weighted antimagic labeling
(Elsevier, 2018-08)
A graph G = (V, E) is weighted-k-antimagic if for each w : V -> R, there is an injective function f : E -> {1,...,vertical bar E vertical bar + k} such that the following sums are all distinct: for each vertex u, Sigma(v:uv ...