A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single machine precedence constrained scheduling is a Vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Long Code Test with One Free Bit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supermodular relaxation for scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / 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: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of a simple scheduling polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Scheduling in Order of α-Points on a Single Machine / rank
 
Normal rank

Latest revision as of 19:49, 17 July 2024

scientific article
Language Label Description Also known as
English
A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
scientific article

    Statements

    A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (English)
    0 references
    0 references
    11 January 2019
    0 references
    approximation algorithm
    0 references
    machine scheduling
    0 references
    precedence constraints
    0 references
    total weighted completion time
    0 references
    LP relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references