Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.dam.2010.01.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963587549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of Half-Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithm for job sequencing with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval / 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: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / 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: Approximation algorithms for scheduling a single machine to minimize total late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for a class of subset selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling two parallel machines with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:13, 3 July 2024

scientific article
Language Label Description Also known as
English
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
scientific article

    Statements

    Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (English)
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    scheduling
    0 references
    tardiness
    0 references
    common due date
    0 references
    FPTAS
    0 references
    approximation
    0 references
    0 references