Scheduling Independent Tasks with Due Times on a Uniform Processor System

Authors:
Sartaj Sahni;Yookun Cho
Affiliations:
Department of Computer Science, University of Minnesota, 136 Lind Hall, 207 Church St., SE, Minneapolis, MN;Computer Science Department, Seoul National University, Seoul, Korea and University of Minnesota, Minneapolis, Minnesota
Venue:
Journal of the ACM (JACM)
Year:
1980

Citing 1
Cited 6

Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)

On satisfying timing constraints in hard-real-time systems

SIGSOFT '91 Proceedings of the conference on Software for citical systems
Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)
On Satisfying Timing Constraints in Hard-Real-Time Systems

IEEE Transactions on Software Engineering
Minimizing total completion time on uniform machines with deadline constraints

ACM Transactions on Algorithms (TALG)
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times --- A Polymatroid Optimization Approach

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract