MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Vitaly A. Strusevich / rank
Normal rank
 
Property / author
 
Property / author: Vitaly A. Strusevich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower and Upper Bounds for Scheduling Around a Small Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks / rank
 
Normal rank

Latest revision as of 22:03, 2 July 2024

scientific article
Language Label Description Also known as
English
MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
scientific article

    Statements

    MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (English)
    0 references
    0 references
    0 references
    18 June 2010
    0 references
    quadratic knapsack
    0 references
    single machine scheduling
    0 references
    earliness-tardiness
    0 references
    FPTAS
    0 references

    Identifiers