Improving the complexities of approximation algorithms for optimization problems

Authors:
Mikhail Y. Kovalyov
Affiliations:
Institute of Engineering Cybernetics, Belarus Academy of Sciences, Surganova 6, 220012 Minsk, Belarus
Venue:
Operations Research Letters
Year:
1995

Citing 5
Cited 4

Single machine scheduling to minimize total late work

Operations Research
A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work

Mathematics of Operations Research
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
A fully polynomial approximation scheme for the total tardiness problem

Operations Research Letters

Integrated production and delivery scheduling with disjoint windows

Discrete Applied Mathematics
Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties

Operations Research
Errata and comments on “Approximation algorithms for the capacitated plant allocation problem”

Operations Research Letters
A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A procedure to improve the lower and upper bound for the optimal objective function value of a minimization problem is presented. The procedure is based on an approximation scheme. Properties of this approximation scheme are established on which the correctness and effectiveness of the bound improvement procedure are based. The procedure is applied to improve the computational complexities of approximation algorithms for several single and parallel machine scheduling problems.