An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960)

From MaRDI portal
Revision as of 07:27, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
scientific article

    Statements

    An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    machine scheduling
    0 references
    start time-dependent processing times
    0 references
    makespan
    0 references
    approximation algorithms
    0 references

    Identifiers