Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168): Difference between revisions

Latest revision as of 06:15, 16 July 2024

scientific article; zbMATH DE number 6914630

Language	Label	Description	Also known as
English	Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines	scientific article; zbMATH DE number 6914630

Statements

instance of

scholarly article

0 references

title

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (English)

0 references

published in

RAIRO - Operations Research

0 references

publication date

8 August 2018

0 references

zbMATH Keywords

scheduling

0 references

parallel machine

0 references

approximation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1051/ro/2017044

0 references

cites work

Fast approximation algorithm for job sequencing with deadlines

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval

0 references

Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

0 references

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

0 references

Approximation algorithms for single machine scheduling with one unavailability period

0 references

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

0 references

Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications

0 references

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

0 references

Q2712370

0 references

Capacitated two-parallel machines scheduling to minimize sum of job completion times

0 references

Minimizing the sum of job completion times on capacitated two-parallel machines

0 references

Algorithms for Scheduling Independent Tasks

0 references

Scheduling with limited machine availability

0 references

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

0 references

A strongly polynomial FPTAS for the symmetric quadratic knapsack problem

0 references

Identifiers

zbMATH Open document ID

1395.90148

0 references

DOI

10.1051/ro/2017044

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4578168

@@ Property / full work available at URL @@
+https://doi.org/10.1051/ro/2017044
+Normal rank
@@ Property / OpenAlex ID @@
+W2620541949
@@ Property / OpenAlex ID: W2620541949 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59228840
@@ Property / Wikidata QID: Q59228840 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithm for job sequencing with deadlines
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
+Normal rank
@@ Property / cites work @@
+Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for single machine scheduling with one unavailability period
+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 @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
+Normal rank
@@ Property / cites work @@
+Q2712370
@@ Property / cites work: Q2712370 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated two-parallel machines scheduling to minimize sum of job completion times
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of job completion times on capacitated two-parallel machines
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Independent Tasks
@@ Property / cites work: Algorithms for Scheduling Independent Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with limited machine availability
@@ Property / cites work: Scheduling with limited machine availability / rank @@
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
+Normal rank