Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
type: Item
instance of: scholarly article
title: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
zbMATH Open document ID: 1197.90209
author: Imed Kacem
published in: Discrete Applied Mathematics
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5798494
zbMATH Keywords: scheduling
zbMATH Keywords: tardiness
zbMATH Keywords: common due date
zbMATH Keywords: FPTAS
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.dam.2010.01.013
OpenAlex ID: W1963587549
cites work: Minimization of half-products
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
cites work: Approximation algorithms for scheduling a single machine to minimize total late work
cites work: Approximation schemes for a class of subset selection problems
cites work: Combinatorial Problems: Reductibility and Approximation
cites work: A comment on scheduling two parallel machines with capacity constraints
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
DOI: 10.1016/J.DAM.2010.01.013
description: scientific article; zbMATH DE number 5798494