Scheduling on unrelated machines under tree-like precedence constraints (Q2391177): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9004-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2173690244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dependent randomized rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-processor scheduling to minimize flow time with ε resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Guarantees for Job-Shop Scheduling / 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: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing and Applied Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for shop scheduling problems with minsum objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank

Latest revision as of 20:31, 1 July 2024

scientific article
Language Label Description Also known as
English
Scheduling on unrelated machines under tree-like precedence constraints
scientific article

    Statements

    Scheduling on unrelated machines under tree-like precedence constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    precedence-constrained scheduling
    0 references
    job-shop scheduling
    0 references
    approximation algorithms
    0 references
    randomized algorithms
    0 references
    0 references
    0 references
    0 references
    0 references