Scheduling Independent Tasks with Due Times on a Uniform Processor System

DOI10.1145/322203.322214MaRDI QIDQ3930627zbMATH OpenOpenAlexFDO

Authors Yookun Cho, Sartaj Sahni

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322203.322214

zbMATH Keywords

preemptive schedule

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption
• Scheduling electric vehicle regular charging tasks: a review of deterministic models
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Preemptive scheduling on uniform parallel machines with controllable job processing times

This page was built for publication: Scheduling Independent Tasks with Due Times on a Uniform Processor System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3930627)