Scheduling 0n Single Machine with Release date to Minimize Total Completion times and Maximum Lateness


In this paper, we study the problem of scheduling n jobs on a single machine to minimize total cost of total completion times and maximum lateness of all jobs with release date. Each job i has a release date ri, processing time pi and due date di. We derive several upper bounds and a lower bound, these bounds are used in a branch and bound solution method. Because of the computational complexity of the problem, near optimal solutions are obtained by developed algorithms. All algorithms are tested and computational experiment are given in tables.