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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Operations research Jg. 47; H. 5; S. 757
Hauptverfasser:	Kovalyov, Mikhail Y, Kubiak, Wieslaw
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum Institute for Operations Research and the Management Sciences 01.09.1999
Schlagworte:	Approximation Job shops Just in time Operations research Scheduling Studies
ISSN:	0030-364X, 1526-5463
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!