Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57633883 / 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.1016/j.mcm.2009.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971048091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the single-machine total tardiness problem is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the 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: Decomposition of the single machine total tardiness problem / 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: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the total tardiness single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Total Tardiness Problem: Review and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine / rank
 
Normal rank

Latest revision as of 01:31, 2 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
scientific article

    Statements

    Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (English)
    0 references
    0 references
    0 references
    12 October 2009
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    total tardiness
    0 references
    even-odd partition
    0 references
    \(NP\)-hardness
    0 references
    0 references
    0 references