Abstract

In this paper we consider the problem of scheduling n jobs on a single machine to discuss the relationship between weighted earliness and weighted tardiness problems (i.e., the problems 1/ci≤di/∑Wi Ei and 1/Cj≥dj/∑Wj Tj ). These two problems are NP-hard ,for special case we proved a good result that EDD rule with Ei≤Pi is optimal for 1/ci≤di/∑Wi Ei problem . Also we proved that and are equivalent for 1/Ci≤di/ problem and 1/Cj≥dj/ problem. The properties between weighted earliness and weighted tardiness problems are given with some examples.

The article was added to IASJ on 2014-03-06

359 Total full text downloads since the date of addition