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

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

instance of

scholarly article

0 references

title

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

International Journal of Foundations of Computer Science

0 references

publication date

18 June 2010

0 references

zbMATH Keywords

quadratic knapsack

0 references

single machine scheduling

0 references

earliness-tardiness

0 references

FPTAS

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

0 references

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

0 references

Scheduling around a small common due date

0 references

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

0 references

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

0 references

A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

The quadratic knapsack problem -- a survey

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

0 references

Identifiers

zbMATH Open document ID

1192.68102

0 references

DOI

10.1142/S0129054110007301

0 references

Mathematics Subject Classification ID

68M20

0 references

zbMATH DE Number

5723432

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3569281

@@ Property / cites work @@
+Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
+Normal rank
@@ Property / cites work @@
+Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
+Normal rank
@@ Property / cites work @@
+Scheduling around a small common due date
@@ Property / cites work: Scheduling around a small common due date / rank @@
+Normal rank
@@ Property / cites work @@
+New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+The quadratic knapsack problem -- a survey
@@ Property / cites work: The quadratic knapsack problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Convex quadratic and semidefinite programming relaxations in scheduling
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
+Normal rank