We show that WSRPT guarantees the competitive ratio 1.2259 and that this competitive ratio is tight for WSRPT. Therefore, WSRPT is the best known algorithm for online total weighted completion time scheduling on a single machine with preemption.
Jul 15, 2023
Jul 15, 2023 · In this paper, we present the tight competitive ratio 1.2259 for WSRPT. To this end, we iteratively reduce the instance space of the problem without affecting ...
This result makes WSRPT the best known algorithm for deterministic online total weighted completion time scheduling in a preemptive single machine environment ...
Jul 25, 2023 · Samin Jamalabadi, Uwe Schwiegelshohn: WSRPT is 1.2259-competitive for Weighted Completion Time Scheduling. CoRR abs/2307.07739 (2023).
Nov 21, 2024 · ... WSRPT is 1.2259-competitive for Weighted Completion Time Scheduling. Preprint. Jul 2023. Samin Jamalabadi · Uwe Schwiegelshohn.
People also ask
What is the total weighted completion time?
What is weighted shortest remaining processing time?
Megow [12] showed that the algorithm WSRPT does not have a competitive ratio less than 1.21057 for the weighted completion scheduling problem on single ma- ...
Missing: 1.2259- | Show results with:1.2259-
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm · WSRPT is 1.2259-competitive for Weighted Completion Time ...
A ρ-competitive algorithm provides for any instance a solution with an objective function value of at most ρ times the value of an optimal off-line solution.
Sep 21, 2023 · We consider the precedence-constrained scheduling problem to minimize the total weighted completion time. For a single machine several ...
We study approximation algorithms for scheduling problems with the objective of minimizing total weighted completion time, under identical and related machine ...