Fast approximation algorithms for job scheduling with processing set restrictions (Q410716): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Joseph Y.-T. Leung / rank
Normal rank
 
Property / author
 
Property / author: Joseph Y.-T. Leung / 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.1016/j.tcs.2010.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113497279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing in a Hierarchical Server Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task Scheduling on a Multiprocessor System with Independent Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions and job release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:46, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast approximation algorithms for job scheduling with processing set restrictions
scientific article

    Statements

    Fast approximation algorithms for job scheduling with processing set restrictions (English)
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    0 references
    tree-hierarchical processing set
    0 references
    inclusive processing set
    0 references
    nested processing set
    0 references
    makespan minimization
    0 references
    polynomial-time approximation algorithm
    0 references
    NP-hard
    0 references
    nonpreemptive scheduling
    0 references
    0 references