We consider both branch-and-cut and column generation approaches for the problem of finding a minimum cost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without Constraint Programming. Among the...

In this paper we consider the scheduling problem of minimizing the sum of the weights of the late jobs on a single machine (1-r- S wj Uj). A branch-and-check algorithm is proposed, where a relaxed integer programming formulation is solved by branch-and-bound and infeasible solutions are cut off...