Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4252370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear probing and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank

Revision as of 05:37, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
scientific article

    Statements

    Approximation results for a bicriteria job scheduling problem on a single machine without preemption (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2009
    0 references
    approximation algorithms
    0 references
    bicriteria optimization
    0 references
    single machine scheduling
    0 references
    approximate Pareto curve
    0 references

    Identifiers