On the public citation graph

Online Scheduling with Hard Deadlines on Parallel Machines

0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1999.1060openalex-snapshot
Online Scheduling with Hard Deadlines
inferredcites →https://doi.org/10.1007/11785293openalex-snapshot
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
inferredcites →https://doi.org/10.1007/11785293_13openalex-snapshot
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_32openalex-snapshot
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
inferredcites →https://doi.org/10.1007/s10288-003-0024-4openalex-snapshot
Ten notes on equal-processing-time scheduling
inferredcites →https://doi.org/10.1023/a:1022956425198openalex-snapshot
Admission Control with Immediate Notification
inferredcites →https://doi.org/10.1023/a:1022994010777openalex-snapshot
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
inferredcites →https://doi.org/10.1145/777412.777416openalex-snapshot
Online deadline scheduling

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11785293_13openalex-snapshot
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_39openalex-snapshot
Online Scheduling of Equal-Length Jobs on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_4openalex-snapshot
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_33openalex-snapshot
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_42openalex-snapshot
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_2openalex-snapshot
Open Problems in Throughput Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_5openalex-snapshot
Online Scheduling of Unit Length Jobs with Commitment and Penalties
inferred← citeshttps://doi.org/10.1007/s10951-013-0321-5openalex-snapshot
Online scheduling with preemption or non-completion penalties
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120157openalex-snapshot
Optimal deadline scheduling with commitment
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567052openalex-snapshot
Online packet scheduling with hard deadlines in multihop communication networks
inferred← citeshttps://doi.org/10.1109/pesgm.2012.6345497openalex-snapshot
Large scale charging of Electric Vehicles
inferred← citeshttps://doi.org/10.1109/tnet.2014.2363136openalex-snapshot
Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks
inferred← citeshttps://doi.org/10.1109/tnet.2015.2442597openalex-snapshot
Online Load Balancing Under Graph Constraints
inferred← citeshttps://doi.org/10.1109/tnet.2019.2917393openalex-snapshot
Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop Networks
inferred← citeshttps://doi.org/10.1137/s0097539704446608openalex-snapshot
Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
inferred← citeshttps://doi.org/10.1145/1435375.1435377openalex-snapshot
Online nonpreemptive scheduling of equal-length jobs on two identical machines
inferred← citeshttps://doi.org/10.1145/3143314.3078540openalex-snapshot
On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks
inferred← citeshttps://doi.org/10.1145/3350755.3400271openalex-snapshot
Commitment and Slack for Online Load Maximization
inferred← citeshttps://doi.org/10.1613/jair.5100openalex-snapshot
Efficient Mechanism Design for Online Scheduling
inferred← citeshttps://doi.org/10.3934/energy.2017.3.529openalex-snapshot
Profit maximization with customer satisfaction control for electric vehicle charging in smart grids
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.