Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9251-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093392878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Precedence-Constrained Single Machine Scheduling by Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Precedence Constraints of Low Fractional Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders of dimension 2 / 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: On the hardness of approximating minimum vertex cover / 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: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411395 / 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: 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: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time / 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: Single Machine Scheduling with Precedence Constraints of Dimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of average completion time scheduling under precedence constraints. / rank
 
Normal rank

Latest revision as of 13:44, 1 July 2024

scientific article
Language Label Description Also known as
English
Single machine precedence constrained scheduling is a Vertex cover problem
scientific article

    Statements

    Single machine precedence constrained scheduling is a Vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    0 references
    algorithms
    0 references
    scheduling
    0 references
    vertex cover
    0 references
    0 references
    0 references
    0 references
    0 references