Tight bounds for the identical parallel machine scheduling problem (Q3429035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. II / 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: 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: Lower bounds for scheduling on identical parallel machines with heads and tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast lifting procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search metaheuristics for discrete-continuous scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the identical parallel machine scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming on the word RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and evaluation of tabu search algorithms for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lower bound for the makespan problem / rank
 
Normal rank

Latest revision as of 16:41, 25 June 2024

scientific article
Language Label Description Also known as
English
Tight bounds for the identical parallel machine scheduling problem
scientific article

    Statements

    Tight bounds for the identical parallel machine scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2007
    0 references
    0 references
    0 references