A composite algorithm for multiprocessor scheduling (Q544815): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-010-9135-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122276643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365136 / 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: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem / 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 linear time approximation algorithm for multiprocessor scheduling / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution of open bin packing problems / 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: Q4398369 / 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: Improved 0/1-interchange scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / 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: A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and evaluation of tabu search algorithms for multiprocessor scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:45, 4 July 2024

scientific article
Language Label Description Also known as
English
A composite algorithm for multiprocessor scheduling
scientific article

    Statements

    A composite algorithm for multiprocessor scheduling (English)
    0 references
    0 references
    0 references
    16 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    approximation algorithms
    0 references
    0 references