On the public citation graph
Online Bin Packing with Load-Balancing
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.1002/j.1538-7305.1966.tb01709.xopenalex-extracted
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1007/3-540-45253-2_19openalex-extracted
Online Scheduling Revisited
inferredcites →https://doi.org/10.1007/978-3-031-59835-7_14openalex-extracted
Fully-Dynamic Load Balancing
inferredcites →https://doi.org/10.1007/978-3-031-79995-2openalex-extracted
Stochastic Network Optimization with Application to Communication and Queueing Systems
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_27openalex-extracted
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_50openalex-extracted
A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_21openalex-extracted
Online Multidimensional Load Balancing
inferredcites →https://doi.org/10.1007/s10107-018-1325-xopenalex-extracted
Fully dynamic bin packing revisited
inferredcites →https://doi.org/10.1016/0377-2217(90)90215-wopenalex-extracted
A state-of-the-art review of parallel-machine scheduling research
inferredcites →https://doi.org/10.1016/0377-2217(91)90304-eopenalex-extracted
Mathematical programming formulations for machine scheduling: A survey
inferredcites →https://doi.org/10.1016/j.cor.2009.05.008openalex-extracted
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
inferredcites →https://doi.org/10.1016/j.dam.2018.07.010openalex-extracted
A study on load-balanced variants of the bin packing problem
inferredcites →https://doi.org/10.1016/s0022-0000(74)80026-7openalex-extracted
Fast algorithms for bin packing
inferredcites →https://doi.org/10.1109/icde60146.2024.00397openalex-extracted
Resource Allocation with Service Affinity in Large-Scale Cloud Environments
inferredcites →https://doi.org/10.1109/lcomm.2020.3013125openalex-extracted
Lyapunov Drift-Plus-Penalty Optimization for Queues With Finite Capacity
inferredcites →https://doi.org/10.1137/1.9781611973075.131openalex-extracted
The (1 + β)-Choice Process and Weighted Balls-into-Bins
inferredcites →https://doi.org/10.1137/1.9781611975031.63openalex-extracted
Randomized Algorithms for Online Vector Load Balancing
inferredcites →https://doi.org/10.1137/17m111835xopenalex-extracted
Tight Bounds for Online Vector Scheduling
inferredcites →https://doi.org/10.1137/s0097539702403438openalex-extracted
Improved Bounds for the Online Scheduling Problem
inferredcites →https://doi.org/10.1145/1120582.1120583openalex-extracted
On the Sum-of-Squares algorithm for bin packing
inferredcites →https://doi.org/10.1145/1284320.1284321openalex-extracted
AdWords and generalized online matching
inferredcites →https://doi.org/10.1145/3379482openalex-extracted
Online Linear Optimization with Inventory Management Constraints
inferredcites →https://doi.org/10.1145/3578338.3593532openalex-extracted
Constant Regret Primal-Dual Policy for Multi-way Dynamic Matching
inferredcites →https://doi.org/10.1145/3736252.3742646openalex-extracted
Distributed Load Balancing with Workload-Dependent Service Rates
inferredcites →https://doi.org/10.1287/mnsc.2018.3091openalex-extracted
Overcommitment in Cloud Services: Bin Packing with Chance Constraints
inferredcites →https://doi.org/10.1287/mnsc.2018.3169openalex-extracted
Capacity Allocation in Flexible Production Networks: Theory and Applications
inferredcites →https://doi.org/10.1287/mnsc.2018.3220openalex-extracted
Online Resource Allocation with Limited Flexibility
inferredcites →https://doi.org/10.1287/mnsc.2019.3449openalex-extracted
Online Demand Fulfillment Under Limited Flexibility
inferredcites →https://doi.org/10.1287/mnsc.2021.4216openalex-extracted
Inventory Balancing with Online Learning
inferredcites →https://doi.org/10.1287/mnsc.2023.04307openalex-extracted
Good Prophets Know When the End Is Near
inferredcites →https://doi.org/10.1287/mnsc.41.4.577openalex-extracted
Principles on the Benefits of Manufacturing Process Flexibility
inferredcites →https://doi.org/10.1287/moor.18.2.438openalex-extracted
On Line Bin Packing with Items of Random Size
inferredcites →https://doi.org/10.1287/moor.2019.1039openalex-extracted
Last-Mile Shared Delivery: A Discrete Sequential Packing Approach
inferredcites →https://doi.org/10.1287/moor.2021.1239openalex-extracted
Adaptive Bin Packing with Overflow
inferredcites →https://doi.org/10.1287/msom.2019.0832openalex-extracted
Online Advance Scheduling with Overtime: A Primal-Dual Approach
inferredcites →https://doi.org/10.1287/opre.2019.1914openalex-extracted
Interior-Point-Based Online Stochastic Bin Packing
inferredcites →https://doi.org/10.1287/opre.2022.2386openalex-extracted
Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources
inferredcites →https://doi.org/10.2139/ssrn.5312131openalex-extracted
On the Power of Delayed Flexibility: Balls, Bins, and a Few Opaque Promotions
inferredcites →https://doi.org/10.4230/lipics.esa.2021.59openalex-extracted
Graph Searching with Predictions
inferredcites →https://doi.org/10.48550/arxiv.2001.04698openalex-extracted
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
inferredcites →https://doi.org/10.48550/arxiv.2112.03200openalex-extracted
Online Bin Packing with Known T
inferredcites →https://doi.org/10.48550/arxiv.2308.05087openalex-extracted
Mean-Biased Processes for Balanced Allocations
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.