Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with deadlines and increasing rates of 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: Q3837425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with varying processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233364 / 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 jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank

Revision as of 21:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
scientific article

    Statements

    Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    single machine scheduling
    0 references
    deteriorating jobs
    0 references
    total completion time
    0 references
    approximate algorithm
    0 references

    Identifiers