Abstract

This paper addresses the problem of minimizing the sum of total completion times, maximum earliness and maximum tardiness on a single machine with unequal release date. A branch and bound algorithm with forward approach, in order to find the exact (optimal) solution for itwith two lower bounds (LB_1,LB_2) and four upper bounds〖(UB〗_1,UB_2,UB_3,UB_4) that introduced in this paper. Ten special cases are suggested and proved that yield optimal solution. In general, this problem is strongly NP-hard, and solved it with up to 30 jobs.

Keywords

The article was added to IASJ on 2014-08-01

303 Total full text downloads since the date of addition