Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q65553897, #quickstatements; #temporary_batch_1706974296281
Created claim: DBLP publication ID (P1635): journals/mp/CorreaMMSSVV15, #quickstatements; #temporary_batch_1731505720702
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164915638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa claus meets hypergraph matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing scheduling with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting versus setup trade-offs for scheduling to minimize weighted completion time / 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 threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579476 / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructive Aspects of the Lovász Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / 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: Minimizing total completion time subject to job release dates and preemption penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split scheduling with uniform setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Jobs on Several Machines with the Job Splitting Property / 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: Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times 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: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with splitting jobs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/CorreaMMSSVV15 / rank
 
Normal rank

Latest revision as of 14:54, 13 November 2024

scientific article
Language Label Description Also known as
English
Strong LP formulations for scheduling splittable jobs on unrelated machines
scientific article

    Statements

    Strong LP formulations for scheduling splittable jobs on unrelated machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2015
    0 references
    0 references
    0 references
    0 references

    Identifiers