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

Celý popis

Podrobná bibliografia

Vydané v:	Operations research Ročník 47; číslo 5; s. 757
Hlavní autori:	Kovalyov, Mikhail Y, Kubiak, Wieslaw
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Linthicum Institute for Operations Research and the Management Sciences 01.09.1999
Predmet:	Approximation Job shops Just in time Operations research Scheduling Studies
ISSN:	0030-364X, 1526-5463
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!