Scheduling of Single Machine with Release Date to Minimize Multiple Objective Functions

摘要

The aim of this paper is to derive several upper bounds and a lower bound, these bounds to be used in a branch and bound method. Because of the computational complexity of the our problem, optimal and near-optimal solutions are obtained by developed algorithms. All algorithms are tested and computational experiments is given in tables.