Erratum to: ``Minimizing total tardiness on parallel machines with preemptions'' (Q398871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57633812 / 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.1007/s10951-013-0313-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002735797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness on parallel machines with preemptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:35, 8 July 2024

scientific article
Language Label Description Also known as
English
Erratum to: ``Minimizing total tardiness on parallel machines with preemptions''
scientific article

    Statements

    Erratum to: ``Minimizing total tardiness on parallel machines with preemptions'' (English)
    0 references
    0 references
    0 references
    18 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel machines
    0 references
    total tardiness
    0 references
    preemptive problems
    0 references
    linear programming
    0 references
    polynomial algorithm
    0 references
    NP-hardness
    0 references
    0 references
    0 references