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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A survey of single machine scheduling to minimize weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling with Unit Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine common due date total earliness/tardiness scheduling with machine unavailability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit processing time jobs on a single machine with multiple criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with release times, deadlines, setup times, and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of deciding whether the regular number is at most two / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parametric complexity of schedules to minimize tardy tasks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized multi-scenario single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of single machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of the just-in-time flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fixed number of bins revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness Measures for Resource Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling chains on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sequencing <i>n</i> Jobs on One Machine to Minimize the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Optimality Proof of Moore's Sequencing Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints / rank
 
Normal rank

Revision as of 12:22, 1 August 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

    Equitable scheduling on a single machine (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2023
    0 references
    resource allocation
    0 references
    fairness
    0 references
    equity
    0 references
    fixed-parameter tractability
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references

    Identifiers