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

Authors:
Mikhail Y. Kovalyov;Wieslaw Kubiak
Affiliations:
-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 18

When does a dynamic programming formulation guarantee the existence of an FPTAS?

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Machine scheduling with earliness, tardiness and non-execution penalties

Computers and Operations Research
Stochastic Scheduling With Asymmetric Earliness And Tardiness Penalties Under Random Machine Breakdowns

Probability in the Engineering and Informational Sciences
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Information Processing Letters
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Note: FPTAS for half-products minimization with scheduling applications

Discrete Applied Mathematics
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS Journal on Computing
Short Communication: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
Parallel-machine scheduling of simple linear deteriorating jobs

Theoretical Computer Science
Non-approximability of just-in-time scheduling

Journal of Scheduling
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
Note: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Discrete Applied Mathematics
Parallel-machine scheduling with deteriorating jobs and rejection

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

Journal of Scheduling
Parallel-machine scheduling with an availability constraint

Computers and Industrial Engineering
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration

Journal of Combinatorial Optimization
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fully polynomial approximation scheme for the problem of scheduling n jobs on a single machine to minimize total weighted earliness and tardiness is presented. A new technique is used to develop the scheme. The main feature of this technique is that it recursively computes lower and upper bounds on the value of partial optimal solutions. Therefore, the scheme does not require any prior knowledge of lower and upper bounds on the value of a complete optimal solution. This distinguishes it from all the existing approximation schemes.