Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An interactive procedure for bi-criteria production scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine, multi-criteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms minimizing mean flow time: Schedule-length properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of the Makespan Subject to Flowtime Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a MULTIFIT-based scheduling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785477 / rank
 
Normal rank

Revision as of 13:01, 30 May 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan subject to minimum total flow-time on identical parallel machines
scientific article

    Statements

    Minimizing makespan subject to minimum total flow-time on identical parallel machines (English)
    0 references
    0 references
    0 references
    14 September 2000
    0 references
    parallel-machine scheduling
    0 references
    hierarchical criteria
    0 references
    makespan
    0 references
    flow-time
    0 references
    heuristic algorithms
    0 references
    empirical results
    0 references

    Identifiers