Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4365136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / 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: Q4099211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / 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: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact upper bound for the Multifit processor scheduling algorithm / rank
 
Normal rank

Latest revision as of 19:52, 4 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the makespan in nonpreemptive parallel machine scheduling problem
scientific article

    Statements

    Minimizing the makespan in nonpreemptive parallel machine scheduling problem (English)
    0 references
    2 January 2012
    0 references
    optimization
    0 references
    scheduling
    0 references
    approximation algorithm
    0 references

    Identifiers