Abstract

In this paper we consider the problem of scheduling n jobs on a single machine to discuss the relationship between earliness and tardiness problems (i.e., the problems 1/ci≤di/∑Ei and 1/Cj≥dj/∑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/∑Ei problem . Also we proved that Emax and Tmax are equivalent for 1/Ci≤di/ Emax problem and 1/Cj≥dj/ Tmax problem. The properties between earliness and tardiness problems are given with some examples.

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

307 Total full text downloads since the date of addition