Lower bounds for parallel machine scheduling problems

We study the parallel machine scheduling problem with release dates and consider several ‘min‐sum’ objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to their quality and of their computational time requirement.