A new approach for bicriteria partitioning problem (Q2355323): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling to meet two min-sum objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria approximation algorithms for scheduling problems with communications delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact LPT-bound for maximizing the minimum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling and covering on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Maximizing the minimum completion time on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-approximation algorithm for \(k_i\)-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank

Revision as of 12:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A new approach for bicriteria partitioning problem
scientific article

    Statements

    A new approach for bicriteria partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2015
    0 references
    multiple criteria analysis
    0 references
    worst-case analysis
    0 references
    partitioning
    0 references
    scheduling
    0 references

    Identifiers