Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129364370, #quickstatements; #temporary_batch_1727086005326
 
(4 intermediate revisions by 4 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/s10878-018-0339-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886895431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph balancing: a special case of scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines / 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: A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Configuration-LP of the Restricted Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial approximation for the restricted assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating The Makespan of The Two-Valued Restricted Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-valued case of makespan minimization with assignment constraints / 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: Parallel machine scheduling of machine-dependent jobs with unit-length. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-approximation algorithm for the graph balancing problem with two weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Schedules Jobs on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the configuration-LP for scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some special cases of the restricted assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129364370 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:06, 23 September 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the graph balancing problem with two speeds and two job lengths
scientific article

    Statements

    Approximation algorithms for the graph balancing problem with two speeds and two job lengths (English)
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    makespan minimization
    0 references
    unrelated parallel machines
    0 references
    approximation algorithms
    0 references
    graph balancing problem
    0 references
    restricted assignment problem
    0 references
    scheduling theory
    0 references
    0 references

    Identifiers