Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q282254
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Giuseppe Paletta / rank
 
Normal rank
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/s10852-014-9262-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997682349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751359 / 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: Minimizing the makespan in nonpreemptive parallel machine scheduling problem / 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: Optimal Scheduling of Tasks on Identical Parallel Processors / 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: 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: 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: Tight bounds for the identical parallel machine scheduling problem / 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT / 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: A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / 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: On the exact upper bound for the Multifit processor scheduling algorithm / rank
 
Normal rank

Latest revision as of 03:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Partial solutions and multifit algorithm for multiprocessor scheduling
scientific article

    Statements

    Partial solutions and multifit algorithm for multiprocessor scheduling (English)
    0 references
    0 references
    0 references
    1 December 2015
    0 references
    multiprocessor scheduling
    0 references
    identical parallel machines
    0 references
    \textit{MultiFit}
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers