Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
From MaRDI portal
Publication:5363760
DOI10.4230/LIPIcs.IPEC.2015.55zbMath1378.68021OpenAlexW2255606401MaRDI QIDQ5363760
Danny Hermelin, Dvir Shabtay, Judith-Madeleine Kubitza, Nimrod Talmon, Gerhard J. Woeginger
Publication date: 29 September 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2015.55
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ On the parameterized tractability of single machine scheduling with rejection ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem ⋮ Scheduling meets \(n\)-fold integer programming
This page was built for publication: Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
