Abstract
We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task j is associated with a nonnegative weight wj , a release date, a due date, and an interval of possible processing times. A task j can either be scheduled with a total processing time pj which is in the given interval, or rejected (not participating in the schedule). The reward for processing j for pj time units is wjpj , and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds.
Original language | English |
---|---|
Pages (from-to) | 101-122 |
Number of pages | 22 |
Journal | Acta Informatica |
Volume | 60 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2023 |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Computer Networks and Communications