Tutorial: hard real-time systems
Tutorial: hard real-time systems
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Algorithms for total weighted completion time scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Discrete Applied Mathematics
Real-Time Systems Design and Analysis: An Engineer's Handbook
Real-Time Systems Design and Analysis: An Engineer's Handbook
Real-Time Systems
Introduction to Linear Optimization
Introduction to Linear Optimization
Real Time Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Soft Real-Time Systems: Predictability vs. Efficiency (Series in Computer Science)
Soft Real-Time Systems: Predictability vs. Efficiency (Series in Computer Science)
Minimizing the total weighted completion time on unrelated parallel machines with stochastic times
WSC '05 Proceedings of the 37th conference on Winter simulation
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Task Allocation and Migration Algorithm for Temperature-Constrained Real-Time Multi-Core Systems
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Hi-index | 0.00 |
A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it finishes, the higher the penalty that is paid. For a set of soft real-time tasks that are to be scheduled on a single machine, our objective is to minimize the total penalty paid. Since the problem is NP-hard, it is not known whether an optimal schedule can be found in polynomial time. We prove four properties of any optimal scheduling algorithm for the problem. Then, we derive a number of heuristic algorithms which hold the properties obtained herein. The heuristic algorithms differ in the way that the tasks priorities are assigned. These algorithms assign priorities by using functions of task execution times, penalty factors or deadlines. Numerical simulations are presented to compare the penalty to be paid by each algorithm.