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 ...

In this paper, we present a branch-and-bound approach for solving a two-machine flow shop scheduling problem, in which the objective is to minimize a weighted combination of job flowtime and schedule ...