New bounds for the identical parallel processor weighted flow time problem

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems

Theoretical Computer Science - Approximation and online algorithms

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Computers and Operations Research

A priori parallel machines scheduling

Computers and Industrial Engineering

Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Operations Research Letters

The complexity of scheduling job families about a common due date

Operations Research Letters