Approximation algorithms for UET scheduling problems with exact delays (Q2457273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Radar pulse interleaving for multi‐target tracking / 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 the complexity of coupled-task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interleaving two-phased jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank
 
Normal rank

Latest revision as of 12:09, 27 June 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for UET scheduling problems with exact delays
scientific article

    Statements

    Approximation algorithms for UET scheduling problems with exact delays (English)
    0 references
    0 references
    0 references
    30 October 2007
    0 references
    Approximation algorithm
    0 references
    scheduling problem
    0 references
    flow shop
    0 references
    makespan
    0 references
    exact delay
    0 references

    Identifiers