On the public citation graph
Cooperation in multi‐organization scheduling
0 signed · 44 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.1007/10968987_4openalex-snapshot
OurGrid: An Approach to Easily Assemble Grids with Equitable Resource Sharing
inferredcites →https://doi.org/10.1007/11823285_17openalex-snapshot
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links
inferredcites →https://doi.org/10.1007/3-540-60153-8_35openalex-snapshot
The ANL/IBM SP scheduling system
inferredcites →https://doi.org/10.1007/978-3-662-03217-6openalex-snapshot
Scheduling Computer and Manufacturing Processes
inferredcites →https://doi.org/10.1016/s0743-7315(03)00108-4openalex-snapshot
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/focs.2004.68openalex-snapshot
The Price of Stability for Network Design with Fair Cost Allocation
inferredcites →https://doi.org/10.1109/icgrid.2006.311024openalex-snapshot
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications
inferredcites →https://doi.org/10.1109/ipdps.2007.370304openalex-snapshot
Analysis of Scheduling Algorithms with Reservations
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/s0097539793248317openalex-snapshot
Scheduling Parallel Machines On-Line
inferredcites →https://doi.org/10.1145/1109557.1109597openalex-snapshot
Distributed selfish load balancing
inferredcites →https://doi.org/10.1177/1094342006070078openalex-snapshot
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1752openalex-snapshot
Multi‐organization scheduling approximation algorithms
inferred← citeshttps://doi.org/10.1002/cpe.3298openalex-snapshot
Coordination mechanisms for decentralized parallel systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_34openalex-snapshot
Analysis of Multi-Organization Scheduling Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_11openalex-snapshot
A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_4openalex-snapshot
Bilevel Adversarial Scheduling Problem on Parallel Machines
inferred← citeshttps://doi.org/10.1007/s10723-011-9179-yopenalex-snapshot
Job Allocation Strategies with User Run Time Estimates for Online Scheduling in Hierarchical Grids
inferred← citeshttps://doi.org/10.1007/s10723-012-9228-1openalex-snapshot
A Game-Theoretic Analysis of Grid Job Scheduling
inferred← citeshttps://doi.org/10.1007/s10951-010-0169-xopenalex-snapshot
On-line hierarchical job scheduling on grids with admissible allocation
inferred← citeshttps://doi.org/10.1007/s10951-022-00774-2openalex-snapshot
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107041openalex-snapshot
Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.10.029openalex-snapshot
Fair resource allocation for different scenarios of demands
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.11.018openalex-snapshot
Single machine adversarial bilevel scheduling problems
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.future.2012.02.004openalex-snapshot
Adaptive parallel job scheduling with resource admissible allocation on two-level hierarchical grids
inferred← citeshttps://doi.org/10.1016/j.parco.2013.09.009openalex-snapshot
A survey on resource allocation in high performance distributed computing systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.031openalex-snapshot
Efficiency and equity in the multi organization scheduling problem
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059081openalex-snapshot
Cooperative project scheduling with controllable processing times: A game theory framework
inferred← citeshttps://doi.org/10.1109/hipc.2011.6152720openalex-snapshot
Coordination mechanisms for selfish multi-organization scheduling
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799127openalex-snapshot
Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem
inferred← citeshttps://doi.org/10.1109/ipdps.2011.112openalex-snapshot
Tight Analysis of Relaxed Multi-organization Scheduling Algorithms
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00192openalex-snapshot
Invited Paper: How Future Buildings Could Redefine Distributed Computing
inferred← citeshttps://doi.org/10.1109/sose.2013.48openalex-snapshot
Maximizing Liquidity in Cloud Markets through Standardization of Computational Resources
inferred← citeshttps://doi.org/10.1109/tpds.2011.47openalex-snapshot
Approximation Algorithms for the Multiorganization Scheduling Problem
inferred← citeshttps://doi.org/10.1109/tsc.2013.24openalex-snapshot
A Real-Time Group Auction System for Efficient Allocation of Cloud Internet Applications
inferred← citeshttps://doi.org/10.1142/s0129626412500065openalex-snapshot
THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING
inferred← citeshttps://doi.org/10.3233/mgs-210349openalex-snapshot
Broker-based optimization of SLA negotiations in cloud computing
inferred← citeshttps://doi.org/10.70675/1f756345z2e2bz47cbz9d07zd44f993b35e9openalex-snapshot
Allocation de ressources et ordonnancement multi-utilisateurs : une approche basée sur l'équité
inferred← citeshttps://doi.org/10.70675/231a9675z58f6z4bd1z83e0z18d257fbd095openalex-snapshot
Axiomatic and computational aspects of discrete optimization problems in collective settings : from Multi-Agent Scheduling to Participatory Budgeting
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.