On the public citation graph
Randomized online scheduling on two uniform machines
0 signed · 114 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/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1006/inco.1999.2809openalex-snapshot
A Randomized Algorithm for Two Servers on the Line
inferredcites →https://doi.org/10.1006/jagm.1999.1070openalex-snapshot
On-Line Load Balancing for Related Machines
inferredcites →https://doi.org/10.1006/jcss.1995.1074openalex-snapshot
New Algorithms for an Ancient Scheduling Problem
inferredcites →https://doi.org/10.1007/bf01759073openalex-snapshot
A strongly competitive randomized paging algorithm
inferredcites →https://doi.org/10.1007/s004530010014openalex-snapshot
Online Randomized Multiprocessor Scheduling
inferredcites →https://doi.org/10.1016/0167-6377(94)90071-xopenalex-snapshot
New lower and upper bounds for on-line scheduling
inferredcites →https://doi.org/10.1016/s0020-0190(97)00099-9openalex-snapshot
A better lower bound on the competitive ratio of the randomized 2-server problem
inferredcites →https://doi.org/10.1016/s0167-6377(98)00032-7openalex-snapshot
Preemptive on-line scheduling for two uniform processors
inferredcites →https://doi.org/10.1016/s0167-6377(99)00062-0openalex-snapshot
A lower bound for on-line scheduling on uniformly related machines
inferredcites →https://doi.org/10.1016/s0167-6377(99)00076-0openalex-snapshot
A comment on scheduling on uniform machines under chain-type precedence constraints
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/0206013openalex-snapshot
Bounds for LPT Schedules on Uniform Processors
inferredcites →https://doi.org/10.1137/0209007openalex-snapshot
Bounds for List Schedules on Uniform Processors
inferredcites →https://doi.org/10.1137/s0097539797324874openalex-snapshot
Better Bounds for Online Scheduling
inferredcites →https://doi.org/10.1145/129712.129718openalex-snapshot
New algorithms for an ancient scheduling problem
inferredcites →https://doi.org/10.1145/258128.258201openalex-snapshot
On-line routing of virtual circuits with applications to load balancing and machine scheduling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.20161openalex-snapshot
A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines
inferred← citeshttps://doi.org/10.1007/11602613_43openalex-snapshot
Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information
inferred← citeshttps://doi.org/10.1007/11841036_31openalex-snapshot
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_20openalex-snapshot
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_23openalex-snapshot
Ordinal On-Line Scheduling on Two Uniform Machines
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_20openalex-snapshot
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_2openalex-snapshot
Online and Semi-online Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_9openalex-snapshot
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_18openalex-snapshot
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_32openalex-snapshot
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_30openalex-snapshot
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_65openalex-snapshot
A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_41openalex-snapshot
Preemptive Online Scheduling with Reordering
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_48openalex-snapshot
Robust Algorithms for Preemptive Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_9openalex-snapshot
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_26openalex-snapshot
Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date
inferred← citeshttps://doi.org/10.1007/s00186-023-00830-3openalex-snapshot
Bin stretching with migration on two hierarchical machines
inferred← citeshttps://doi.org/10.1007/s00224-007-9007-8openalex-snapshot
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
inferred← citeshttps://doi.org/10.1007/s00224-010-9287-2openalex-snapshot
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
inferred← citeshttps://doi.org/10.1007/s00224-013-9451-6openalex-snapshot
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption
inferred← citeshttps://doi.org/10.1007/s00236-003-0134-7openalex-snapshot
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
inferred← citeshttps://doi.org/10.1007/s00236-007-0058-8openalex-snapshot
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
inferred← citeshttps://doi.org/10.1007/s00453-008-9235-6openalex-snapshot
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
inferred← citeshttps://doi.org/10.1007/s00453-012-9718-3openalex-snapshot
Robust Algorithms for Preemptive Scheduling
inferred← citeshttps://doi.org/10.1007/s00607-005-0130-6openalex-snapshot
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines
inferred← citeshttps://doi.org/10.1007/s00607-006-0187-xopenalex-snapshot
Semi-online Machine Covering on Two Uniform Machines with Known Total Size
inferred← citeshttps://doi.org/10.1007/s10100-017-0481-zopenalex-snapshot
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
inferred← citeshttps://doi.org/10.1007/s10100-018-0536-9openalex-snapshot
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
inferred← citeshttps://doi.org/10.1007/s10878-005-4923-5openalex-snapshot
Preemptive Machine Covering on Parallel Machines
inferred← citeshttps://doi.org/10.1007/s10878-006-9005-9openalex-snapshot
Separating online scheduling algorithms with the relative worst order ratio
inferred← citeshttps://doi.org/10.1007/s10878-006-9040-6openalex-snapshot
Semi-online scheduling with “end of sequence” information
inferred← citeshttps://doi.org/10.1007/s10878-008-9195-4openalex-snapshot
A note on hierarchical scheduling on two uniform machines
inferred← citeshttps://doi.org/10.1007/s10878-008-9200-yopenalex-snapshot
Online scheduling with a buffer on related machines
inferred← citeshttps://doi.org/10.1007/s10878-009-9214-0openalex-snapshot
Semi-online scheduling with known maximum job size on two uniform machines
inferred← citeshttps://doi.org/10.1007/s10878-009-9254-5openalex-snapshot
Semi-online scheduling on two uniform machines with the known largest size
inferred← citeshttps://doi.org/10.1007/s10878-009-9265-2openalex-snapshot
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
inferred← citeshttps://doi.org/10.1007/s10878-010-9316-8openalex-snapshot
Optimal semi-online algorithm for scheduling with rejection on two uniform machines
inferred← citeshttps://doi.org/10.1007/s10878-023-01086-7openalex-snapshot
Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
inferred← citeshttps://doi.org/10.1007/s10951-009-0119-7openalex-snapshot
Optimal and online preemptive scheduling on uniformly related machines
inferred← citeshttps://doi.org/10.1007/s10951-010-0177-xopenalex-snapshot
Competitive ratio of List Scheduling on uniform machines and randomized heuristics
inferred← citeshttps://doi.org/10.1007/s10951-012-0288-7openalex-snapshot
Lower bounds for online makespan minimization on a small number of related machines
inferred← citeshttps://doi.org/10.1007/s10951-013-0326-0openalex-snapshot
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
inferred← citeshttps://doi.org/10.1007/s10951-014-0387-8openalex-snapshot
On-line preemptive machine scheduling with $$\ell _p$$ ℓ p norm on two uniform machines
inferred← citeshttps://doi.org/10.1007/s10951-018-0567-zopenalex-snapshot
A survey on makespan minimization in semi-online environments
inferred← citeshttps://doi.org/10.1007/s10951-022-00764-4openalex-snapshot
Parallel solutions for preemptive makespan scheduling on two identical machines
inferred← citeshttps://doi.org/10.1007/s11424-015-3252-8openalex-snapshot
On-Line Scheduling on Parallel Machines to Minimize the Makespan
inferred← citeshttps://doi.org/10.1007/s11590-011-0335-xopenalex-snapshot
On the optimality of list scheduling for online uniform machines scheduling
inferred← citeshttps://doi.org/10.1007/s11590-018-01384-8openalex-snapshot
Optimal online algorithms for MapReduce scheduling on two uniform machines
inferred← citeshttps://doi.org/10.1007/s40305-025-00656-2openalex-snapshot
Optimal Competitive Analysis for Fractional Hierarchical Scheduling on Related Machines
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104868openalex-snapshot
Online scheduling of jobs with favorite machines
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.001openalex-snapshot
Online scheduling on three uniform machines
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.035openalex-snapshot
Approximate strong equilibria in job scheduling games with two uniformly related machines
inferred← citeshttps://doi.org/10.1016/j.dam.2021.10.013openalex-snapshot
Starting time minimization for the maximum job variant
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100954openalex-snapshot
Online speed-robust scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.01.034openalex-snapshot
Fifty years of research in scheduling — Theory and applications
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.002openalex-snapshot
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
inferred← citeshttps://doi.org/10.1016/j.ic.2007.11.004openalex-snapshot
Preemptive scheduling on a small number of hierarchical machines
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.003openalex-snapshot
Optimal preemptive semi-online scheduling on two uniform processors
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.05.022openalex-snapshot
Scheduling on two identical machines with a speed-up resource
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.11.002openalex-snapshot
Optimal non-preemptive semi-online scheduling on two related machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.02.008openalex-snapshot
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.12.005openalex-snapshot
Semi-online scheduling on two uniform processors
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.007openalex-snapshot
Online scheduling on two uniform machines to minimize the makespan
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.020openalex-snapshot
Online scheduling with reassignment on two uniform machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.031openalex-snapshot
Online scheduling with rejection and withdrawal
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.013openalex-snapshot
Semi-online scheduling problems on two uniform machines under a grade of service provision
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.022openalex-snapshot
Semi-online scheduling with bounded job sizes on two uniform machines
inferred← citeshttps://doi.org/10.1016/s0167-6377(01)00071-2openalex-snapshot
Semi-on-line scheduling with ordinal data on two uniform machines
inferred← citeshttps://doi.org/10.1016/s0167-6377(01)00085-2openalex-snapshot
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00179-7openalex-snapshot
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00062-0openalex-snapshot
A lower bound for on-line scheduling on uniformly related machines
inferred← citeshttps://doi.org/10.1023/a:1022960526107openalex-snapshot
Barely Random Algorithms for Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1051/ro/2024042openalex-snapshot
Semi-online scheduling on two uniform parallel machines with initial lookahead
inferred← citeshttps://doi.org/10.1080/10556780903239311openalex-snapshot
Geometric representation for semi on-line scheduling on uniform processors
inferred← citeshttps://doi.org/10.1137/090766139openalex-snapshot
Preemptive Online Scheduling with Reordering
inferred← citeshttps://doi.org/10.1137/s0097539704446608openalex-snapshot
Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
inferred← citeshttps://doi.org/10.1142/s0217595906000772openalex-snapshot
OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
inferred← citeshttps://doi.org/10.1142/s0217595915500323openalex-snapshot
Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
inferred← citeshttps://doi.org/10.1145/3544979.3544993openalex-snapshot
Online List Scheduling for Makespan Minimization
inferred← citeshttps://doi.org/10.12677/orf.2019.94032openalex-snapshot
Online Scheduling Problem for Jobs Arriving over Time on Related Machines
inferred← citeshttps://doi.org/10.1360/ssm-2020-0061openalex-snapshot
Online scheduling on parallel machines: A survey
inferred← citeshttps://doi.org/10.1360/ssm-2024-0095openalex-snapshot
Online scheduling for jobs with arbitrary release times on uniform machines
inferred← citeshttps://doi.org/10.1631/jzus.2007.a0127openalex-snapshot
Online algorithms for scheduling with machine activation cost on two uniform machines
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2018.14openalex-snapshot
Online Makespan Minimization: The Power of Restart
inferred← citeshttps://doi.org/10.4236/iim.2010.28056openalex-snapshot
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
inferred← citeshttps://doi.org/10.4236/iim.2016.84008openalex-snapshot
On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines
inferred← citeshttps://doi.org/10.4236/ijis.2019.92004openalex-snapshot
Better Algorithm for Order On-Line Scheduling on Uniform Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1303.1912openalex-snapshot
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04698openalex-snapshot
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
inferred← citeshttps://doi.org/10.5555/644108.644152openalex-snapshot
Certifying and repairing solutions to large LPs how good are LP-solvers?
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.