Equivalence of some different maintenance activities in single-machine scheduling (Q2422132): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine unbounded parallel-batch scheduling with forbidden intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a maintenance activity to minimize total weighted completion-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time on a single machine with a flexible maintenance activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank

Revision as of 13:31, 19 July 2024

scientific article
Language Label Description Also known as
English
Equivalence of some different maintenance activities in single-machine scheduling
scientific article

    Statements

    Equivalence of some different maintenance activities in single-machine scheduling (English)
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    scheduling
    0 references
    maintenance
    0 references
    dynamic programming
    0 references

    Identifiers