The generalized assignment problem examines the maximum profit assignments of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new ...

This paper presents a new branch and bound algorithm for the single machine total weighted tardiness problem. It obtains lower bounds using a Lagrangian relaxation approach with subproblems that are ...