Approximating Single Machine Scheduling with Scenarios (Q3541793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximating Min-Max (Regret) Versions of Some Polynomial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new multilayered PCP and the hardness of hypergraph vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Combinatorial Optimization with Exponential Scenarios / 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: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / 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: An algorithm for the single machine sequencing problem with precedence constraints / 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: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank

Latest revision as of 20:28, 28 June 2024

scientific article
Language Label Description Also known as
English
Approximating Single Machine Scheduling with Scenarios
scientific article

    Statements

    Approximating Single Machine Scheduling with Scenarios (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2008
    0 references

    Identifiers

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