A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751359 / 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: Scheduling with earliest start and due date constraints on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Tighter Bounds for LPT Scheduling on Uniform Processors / 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: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with restricted piece sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved 0/1-interchange scheduling / 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: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pfort verifier / rank
 
Normal rank

Latest revision as of 14:20, 22 May 2024

scientific article
Language Label Description Also known as
English
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
scientific article

    Statements

    A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 1994
    0 references
    0 references
    heuristic
    0 references
    identical parallel machines
    0 references
    makespan
    0 references
    near-optimal solutions
    0 references
    0 references