A fully polynomial approximation scheme for the weighted earliness-tardiness problem

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 o...

Full description

Bibliographic Details

Published in:	Operations research Vol. 47; no. 5; p. 757
Main Authors:	Kovalyov, Mikhail Y, Kubiak, Wieslaw
Format:	Journal Article
Language:	English
Published:	Linthicum Institute for Operations Research and the Management Sciences 01.09.1999
Subjects:	Approximation Job shops Just in time Operations research Scheduling Studies
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!