Equitable scheduling on a single machine (Q6103750): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:29, 30 December 2024

scientific article; zbMATH DE number 7703055

Language	Label	Description	Also known as
English	Equitable scheduling on a single machine	scientific article; zbMATH DE number 7703055

Statements

scholarly article

0 references

Equitable scheduling on a single machine (English)

0 references

0 references

0 references

George B. Mertzios

0 references

0 references

Rolf Niedermeier

0 references

0 references

Journal of Scheduling

0 references

publication date

27 June 2023

0 references

full work available at URL

https://arxiv.org/abs/2010.04643

0 references

https://dro.dur.ac.uk/32296/1/32296.pdf

0 references

zbMATH Keywords

resource allocation

0 references

fairness

0 references

equity

0 references

fixed-parameter tractability

0 references

approximation

0 references

MaRDI profile type

MaRDI publication profile

0 references

A survey of single machine scheduling to minimize weighted number of tardy jobs

0 references

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date

0 references

Job Shop Scheduling with Unit Processing Times

0 references

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

0 references

Scheduling equal-length jobs on identical parallel machines

0 references

Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time

0 references

Proportionate progress: A notion of fairness in resource allocation

0 references

Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review

0 references

The Price of Fairness

0 references

A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)

0 references

Single-machine common due date total earliness/tardiness scheduling with machine unavailability

0 references

Scheduling unit processing time jobs on a single machine with multiple criteria

0 references

Single-Machine Scheduling with Precedence Constraints

0 references

Parameterized Algorithms

0 references

Single-machine scheduling with release times, deadlines, setup times, and rejection

0 references

On the complexity of deciding whether the regular number is at most two

0 references

A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

0 references

Fundamentals of parameterized complexity

0 references

On the parametric complexity of schedules to minimize tardy tasks.

0 references

Parametrized complexity theory.

0 references

0 references

Some simplified NP-complete graph problems

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

On Representatives of Subsets

0 references

Parameterized multi-scenario single-machine scheduling problems

0 references

On the parameterized tractability of single machine scheduling with rejection

0 references

On the parameterized tractability of the just-in-time flow-shop scheduling problem

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Bin packing with fixed number of bins revisited

0 references

Fast algorithms for bin packing

0 references

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

0 references

Reducibility among Combinatorial Problems

0 references

Fairness Measures for Resource Allocation

0 references

Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division

0 references

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey

0 references

Integer Programming with a Fixed Number of Variables

0 references

Complexity results for scheduling chains on a single machine

0 references

Complexity of Scheduling under Precedence Constraints

0 references

On Sequencing <i>n</i> Jobs on One Machine to Minimize the Number of Late Jobs

0 references

Parameterized complexity of machine scheduling: 15 open problems

0 references

Scheduling and fixed-parameter tractability

0 references

Scheduling with AND/OR Precedence Constraints

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops

0 references

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs

0 references

0 references

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

0 references

A Simple Optimality Proof of Moore's Sequencing Algorithm

0 references

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights

0 references

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width

0 references

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

0 references

The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10951-022-00754-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6103750

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6103750&oldid=39702578"