On the public citation graph
Strong LP formulations for scheduling splittable jobs on unrelated machines
0 signed · 45 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/978-3-642-31594-7_61openalex-snapshot
Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
inferredcites →https://doi.org/10.1007/978-3-642-36694-9_33openalex-snapshot
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/s00453-012-9668-9openalex-snapshot
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
inferredcites →https://doi.org/10.1007/s10951-006-8265-7openalex-snapshot
Lot-sizing scheduling with batch setup times
inferredcites →https://doi.org/10.1007/s10951-013-0359-4openalex-snapshot
On the configuration-LP for scheduling on unrelated machines
inferredcites →https://doi.org/10.1007/s10951-014-0370-4openalex-snapshot
Split scheduling with uniform setup times
inferredcites →https://doi.org/10.1016/j.ejor.2006.06.060openalex-snapshot
A survey of scheduling problems with setup times or costs
inferredcites →https://doi.org/10.1016/s0166-218x(00)00176-1openalex-snapshot
Parallel machine scheduling with splitting jobs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1016/s0736-5845(02)00077-7openalex-snapshot
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
inferredcites →https://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferredcites →https://doi.org/10.1023/b:josh.0000031424.35504.c4openalex-snapshot
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
inferredcites →https://doi.org/10.1057/jors.1992.66openalex-snapshot
Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/110851201openalex-snapshot
Santa Claus Schedules Jobs on Unrelated Machines
inferredcites →https://doi.org/10.1145/1870103.1870104openalex-snapshot
Invited articles section foreword
inferredcites →https://doi.org/10.1145/2049697.2049702openalex-snapshot
New Constructive Aspects of the Lovász Local Lemma
inferredcites →https://doi.org/10.1145/2229163.2229168openalex-snapshot
Santa claus meets hypergraph matchings
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/321906.321909openalex-snapshot
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
inferredcites →https://doi.org/10.1287/opre.44.4.617openalex-snapshot
Scheduling Jobs on Several Machines with the Job Splitting Property
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2307/2582770openalex-snapshot
Theory of Linear and Integer Programming
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.22154openalex-snapshot
A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_8openalex-snapshot
Approximating Weighted Completion Time for Order Scheduling with Setup Times
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_18openalex-snapshot
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $$M^\natural $$-Concave Processing Speeds
inferred← citeshttps://doi.org/10.1007/s10107-021-01694-3openalex-snapshot
Empowering the configuration-IP: new PTAS results for scheduling with setup times
inferred← citeshttps://doi.org/10.1007/s10107-023-02054-zopenalex-snapshot
A constant-factor approximation for generalized malleable scheduling under $$M ^{\natural }$$-concave processing speeds
inferred← citeshttps://doi.org/10.1007/s10489-020-02027-1openalex-snapshot
A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs
inferred← citeshttps://doi.org/10.1007/s10951-017-0517-1openalex-snapshot
Scheduling cleaning activities on trains by minimizing idle times
inferred← citeshttps://doi.org/10.1007/s10951-022-00733-xopenalex-snapshot
Malleable scheduling beyond identical machines
inferred← citeshttps://doi.org/10.1016/j.ijpe.2022.108555openalex-snapshot
A Multi-Machine Scheduling Solution for Homogeneous Processing: Asymptotic Approximation and Applications
inferred← citeshttps://doi.org/10.1016/j.orl.2016.04.011openalex-snapshot
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
inferred← citeshttps://doi.org/10.1080/00207543.2022.2102948openalex-snapshot
Scheduling unrelated machines with job splitting, setup resources and sequence dependency
inferred← citeshttps://doi.org/10.1080/24725854.2017.1380334openalex-snapshot
Task scheduling with progress control
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229078openalex-snapshot
An Approximation for Job Scheduling on Cloud with Synchronization and Slowdown Constraints
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00025openalex-snapshot
Scheduling on (Un-)Related Machines with Setup Times
inferred← citeshttps://doi.org/10.1287/opre.2022.0168openalex-snapshot
Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20406openalex-snapshot
Universal and Tight Online Algorithms for Generalized-Mean Welfare
inferred← citeshttps://doi.org/10.3390/en11082072openalex-snapshot
Green Production Planning and Control for the Textile Industry by Using Mathematical Programming and Industry 4.0 Techniques
inferred← citeshttps://doi.org/10.3934/jimo.2016.12.771openalex-snapshot
Approximate algorithms for unrelated machine scheduling to minimize makespan
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.