A Branch and bound for 1|ri| wiCi, Scheduling Problem


In this paper, we consider a single machine scheduling problem with release dates. The objective is to minimize the total completion time. This problem is know to be strongly NP-hard. We propose two new lower bounds that can be computed in O(n<sup>2</sup>) and in O(n log n) time respectively. We also propose some dominance properties. A branch-and-bound… (More)


8 Figures and Tables