On the approximability of average completion time scheduling under precedence constraints. (Q1408829): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler / 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: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / 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: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank

Latest revision as of 11:27, 6 June 2024

scientific article
Language Label Description Also known as
English
On the approximability of average completion time scheduling under precedence constraints.
scientific article

    Statements

    On the approximability of average completion time scheduling under precedence constraints. (English)
    0 references
    25 September 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Scheduling
    0 references
    Precedence constraints
    0 references
    Interval order
    0 references
    Bipartite order
    0 references
    Approximation algorithms
    0 references
    Approximability threshold
    0 references