A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hans Kellerer / rank
Normal rank
 
Property / author
 
Property / author: Hans Kellerer / 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.tcs.2006.08.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093570686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total weighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem / 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: Approximation algorithms for minimizing the total weighted tardiness on a single machine / 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 Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank

Latest revision as of 11:25, 25 June 2024

scientific article
Language Label Description Also known as
English
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
scientific article

    Statements

    A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    single machine scheduling
    0 references
    weighted total tardiness
    0 references
    dynamic programming
    0 references
    FPTAS
    0 references

    Identifiers