Equitable scheduling on a single machine
From MaRDI portal
Publication:6103750
DOI10.1007/s10951-022-00754-6zbMath1517.90048arXiv2010.04643OpenAlexW3174175903MaRDI QIDQ6103750
Dvir Shabtay, George B. Mertzios, Hendrik Molter, Danny Hermelin, Rolf Niedermeier, Klaus Heeger
Publication date: 27 June 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.04643
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Fundamentals of parameterized complexity
- On the complexity of deciding whether the regular number is at most two
- Scheduling and fixed-parameter tractability
- Complexity results for scheduling chains on a single machine
- Some simplified NP-complete graph problems
- Scheduling equal-length jobs on identical parallel machines
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Parameterized complexity of machine scheduling: 15 open problems
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Fast algorithms for bin packing
- On the parametric complexity of schedules to minimize tardy tasks.
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Proportionate progress: A notion of fairness in resource allocation
- Bin packing with fixed number of bins revisited
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- On the parameterized tractability of single machine scheduling with rejection
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Parameterized multi-scenario single-machine scheduling problems
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Parametrized complexity theory.
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- The Price of Fairness
- Integer Programming with a Fixed Number of Variables
- A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Fairness Measures for Resource Allocation
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Complexity of Scheduling under Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with AND/OR Precedence Constraints
- On Representatives of Subsets
- Reducibility among Combinatorial Problems
- Single-Machine Scheduling with Precedence Constraints
- Job Shop Scheduling with Unit Processing Times
- Parameterized Algorithms
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
This page was built for publication: Equitable scheduling on a single machine
