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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
Normal rank
 
Property / author
 
Property / author: Cheng, T. C. Edwin / 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.ipl.2006.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048309541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted completion time of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling start time dependent jobs to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on single-processor scheduling with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with piecewise linear decreasing processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / 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: Complexity of scheduling tasks with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time-dependent execution times / rank
 
Normal rank

Latest revision as of 09:59, 2 July 2024

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