An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-007-9128-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2798229098 / rank
 
Normal rank

Revision as of 03:17, 20 March 2024

scientific article
Language Label Description Also known as
English
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
scientific article

    Statements

    An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (English)
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    scheduling
    0 references
    batching
    0 references
    non-identical job sizes
    0 references
    makespan
    0 references
    asymptotic PTAS
    0 references
    0 references