On the public citation graph
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<215::aid-jos27>3.0.co;2-yopenalex-snapshot
On the approximability of an interval scheduling problem
inferredcites →https://doi.org/10.1007/bf00365406openalex-snapshot
On the competitiveness of on-line real-time task scheduling
inferredcites →https://doi.org/10.1007/bf02248588openalex-snapshot
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
inferredcites →https://doi.org/10.1007/bfb0019270openalex-snapshot
Integrated processor scheduling for multimedia
inferredcites →https://doi.org/10.1023/a:1019108328296openalex-snapshot
Adaptive source rate control for real‐time wireless video transmission
inferredcites →https://doi.org/10.1023/a:1019156211458openalex-snapshot
Adaptive rate controlled, robust video communication over packet wireless networks
inferredcites →https://doi.org/10.1109/ftdcs.1995.524977openalex-snapshot
Realizing a soft real-time framework for supporting distributed multimedia applications
inferredcites →https://doi.org/10.1109/iwqos.1998.675233openalex-snapshot
Soft real-time application execution with dynamic quality of service assurance
inferredcites →https://doi.org/10.1109/sfcs.1991.185354openalex-snapshot
On-line scheduling in the presence of overload
inferredcites →https://doi.org/10.1109/sffcs.1999.814615openalex-snapshot
Online scheduling to minimize average stretch
inferredcites →https://doi.org/10.1137/s0097539792236882openalex-snapshot
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
inferredcites →https://doi.org/10.1137/s0097539799354138openalex-snapshot
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
inferredcites →https://doi.org/10.1145/244130.244177openalex-snapshot
Adaptive rate-controlled scheduling for multimedia applications
inferredcites →https://doi.org/10.1145/268998.266677openalex-snapshot
The design, implementation and evaluation of SMART
inferredcites →https://doi.org/10.1145/268998.266689openalex-snapshot
CPU reservations and time constraints
inferredcites →https://doi.org/10.1145/301250.301420openalex-snapshot
Approximating the throughput of multiple machines under real-time scheduling
inferredcites →https://doi.org/10.1145/321921.321934openalex-snapshot
Algorithms for Scheduling Independent Tasks
inferredcites →https://doi.org/10.1145/335305.335401openalex-snapshot
Improvements in throughout maximization for real-time scheduling
inferredcites →https://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
inferredcites →https://doi.org/10.1145/504450.504493openalex-snapshot
An overview of the Rialto real-time architecture
inferredcites →https://doi.org/10.1287/opre.26.1.121openalex-snapshot
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
inferredcites →https://doi.org/10.5555/314613.314715openalex-snapshot
Flow and stretch metrics for scheduling continuous job streams
inferredcites →https://doi.org/10.5555/338219.338604openalex-snapshot
Scheduling to minimize average stretch without migration
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560586_21openalex-snapshot
Laxity Helps in Broadcast Scheduling
inferred← citeshttps://doi.org/10.1007/11775096_6openalex-snapshot
Maximizing the Throughput of Multiple Machines On-Line
inferred← citeshttps://doi.org/10.1007/978-3-319-15789-4_9openalex-snapshot
How to Design a Job Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_10openalex-snapshot
Online Interval Scheduling to Maximize Total Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_29openalex-snapshot
Efficient Job Scheduling Algorithms with Multi-type Contentions
inferred← citeshttps://doi.org/10.1007/s10723-015-9340-0openalex-snapshot
Online Bi-Objective Scheduling for IaaS Clouds Ensuring Quality of Service
inferred← citeshttps://doi.org/10.1007/s10878-005-2272-zopenalex-snapshot
Efficient Job Scheduling Algorithms with Multi-Type Contentions
inferred← citeshttps://doi.org/10.1007/s10951-023-00779-5openalex-snapshot
Competitive two-agent scheduling with release dates and preemption on a single machine
inferred← citeshttps://doi.org/10.1007/s11241-017-9293-4openalex-snapshot
Automated competitive analysis of real-time scheduling with graph games
inferred← citeshttps://doi.org/10.1007/s11590-017-1191-0openalex-snapshot
Online C-benevolent job scheduling on multiple machines
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110404openalex-snapshot
An online dynamic dual bin packing with lookahead approach for server-to-cell assignment in computer server industry
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.046openalex-snapshot
Online interval scheduling to maximize total satisfaction
inferred← citeshttps://doi.org/10.1080/24725854.2019.1657606openalex-snapshot
Approximation algorithms for scheduling C-benevolent jobs on weighted machines
inferred← citeshttps://doi.org/10.1109/cloudnet.2014.6969013openalex-snapshot
Bi-objective online scheduling with quality of service for IaaS clouds
inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903786openalex-snapshot
Energy-aware online scheduling: Ensuring quality of service for IaaS clouds
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019250openalex-snapshot
On-line admission control and packet scheduling with interleaving
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.130openalex-snapshot
Online Scheduling for Cloud Computing and Different Service Levels
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004262openalex-snapshot
Online real-time job scheduling with rate of progress guarantees
inferred← citeshttps://doi.org/10.1109/real.2004.14openalex-snapshot
Competitive Algorithms for Fine-Grain Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2005.204openalex-snapshot
The Granularity Metric for Fine-Grain Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/tcad.2020.3012803openalex-snapshot
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling
inferred← citeshttps://doi.org/10.1142/s0129054103001789openalex-snapshot
On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees
inferred← citeshttps://doi.org/10.1145/3350755.3400271openalex-snapshot
Commitment and Slack for Online Load Maximization
inferred← citeshttps://doi.org/10.1299/jsmec.48.21openalex-snapshot
Online Scheduling Aiming to Satisfy Due Date for Flexible Flow Shops
inferred← citeshttps://doi.org/10.13053/cys-17-3-1564openalex-snapshot
Performance Evaluation of Infrastructure as Service Clouds with SLA Constraints
inferred← citeshttps://doi.org/10.17877/de290r-12516openalex-snapshot
New utilization criteria for online scheduling
inferred← citeshttps://doi.org/10.47893/ijess.2012.1063openalex-snapshot
AN INTELLIGENT SCHEDULER APPROACH TO MULTIPROCESSOR SCHEDULING OF APERIODIC TASKS
inferred← citeshttps://doi.org/10.48550/arxiv.1904.06150openalex-snapshot
Maximizing Online Utilization with Commitment
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.