Approximate Deadline-Scheduling with Precedence Constraints (Q3452812): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1507.00748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Column-Restricted and Priority Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Deadline-Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithm for job sequencing with deadlines / 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: 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: Q4875178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Certain Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating covering integer programs with multiplicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering/packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Algorithms for Technology Diffusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling chains on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank

Latest revision as of 02:14, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximate Deadline-Scheduling with Precedence Constraints
scientific article

    Statements

    Approximate Deadline-Scheduling with Precedence Constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references

    Identifiers