Algorithmic paradoxes of the single-machine total tardiness problem (Q5937433): 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.1002/jos.69 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095192428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank

Latest revision as of 18:18, 3 June 2024

scientific article; zbMATH DE number 1619161
Language Label Description Also known as
English
Algorithmic paradoxes of the single-machine total tardiness problem
scientific article; zbMATH DE number 1619161

    Statements

    Algorithmic paradoxes of the single-machine total tardiness problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2001
    0 references
    0 references
    single machine scheduling
    0 references
    due dates
    0 references
    tardiness
    0 references
    decomposition
    0 references
    lower bound
    0 references
    0 references