Scheduling jobs under simple linear deterioration (Q1332800): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0305-0548(94)90080-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968585032 / 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: Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs / 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: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Optimality Proof of Moore's Sequencing Algorithm / rank
 
Normal rank

Latest revision as of 16:38, 22 May 2024

scientific article
Language Label Description Also known as
English
Scheduling jobs under simple linear deterioration
scientific article

    Statements

    Scheduling jobs under simple linear deterioration (English)
    0 references
    0 references
    17 April 1995
    0 references
    simple linear deterioration of processing times
    0 references
    single machine scheduling
    0 references
    makespan
    0 references
    flow-time
    0 references
    total tardiness
    0 references
    number of tardy jobs
    0 references

    Identifiers