Mirror scheduling problems with early work and late work criteria (Q2066692): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115198391, #quickstatements; #temporary_batch_1712443714953
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization problems in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single machine scheduling problem to minimize total early work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines with late work criterion: offline and online cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling starting time dependent tasks with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4758141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling problems with competing agents and earliness minimization objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted late work in the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan in the two-machine flow-shop with release times / rank
 
Normal rank

Revision as of 18:18, 27 July 2024

scientific article
Language Label Description Also known as
English
Mirror scheduling problems with early work and late work criteria
scientific article

    Statements

    Mirror scheduling problems with early work and late work criteria (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 January 2022
    0 references
    single machine
    0 references
    parallel machines
    0 references
    late work
    0 references
    early work
    0 references
    mirror problems
    0 references

    Identifiers