A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time (Q5320231): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / 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: The time dependent machine makespan problem is strongly NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank

Revision as of 19:14, 1 July 2024

scientific article; zbMATH DE number 5584621
Language Label Description Also known as
English
A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
scientific article; zbMATH DE number 5584621

    Statements

    A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time (English)
    0 references
    0 references
    0 references
    0 references
    22 July 2009
    0 references
    scheduling
    0 references
    single-machine
    0 references
    linear decreasing processing time
    0 references
    earliness
    0 references
    tardiness
    0 references
    dynamic programming
    0 references

    Identifiers