Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Single-machine scheduling to minimize a function of two or three maximum cost criteria
Journal of Algorithms
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
Scheduling Problems with Two Competing Agents
Operations Research
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive queue policies for differentiated services
Journal of Algorithms
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Operations Research Letters
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
| Hi-index | 0.00 |
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion packet scheduling is that the value of all packets can be normalized to a single scale, even in cases when packets have different requirements. We demonstrate that this approach can lead to inefficient utilization of network resources.To improve network efficiency, we model packet scheduling as a mixed criteriascheduling problem where there are two distinct sets of jobs: deadline jobs which represent real-time packets in a network and flow jobs which represent other packets in the network. As the names imply, the jobs in these two sets differ by the criteria associated with them.For this problem, the flow jobs are scheduled to minimize the sum of their flow times, and the deadline jobs are scheduled to maximize the value of jobs that complete by their deadlines.We demonstrate that even when there is only a single deadline job, this mixed criteria scheduling problem is NP-Complete. We give a polynomial time optimal algorithm Slacker for the variant where all jobs have unit size and the value of deadline jobs processed by the deadline must be maximized. Given this constraint Slacker minimizes the total flow time. Furthermore, we show that online Slacker is optimal for flow time while being 2-competitive with respect to the deadline jobs when compared to an optimal algorithm like Slacker that maximizes the value of deadline jobs.