Hide/Show Apps

Scheduling jobs on unrelated parallel machines to minimize regular total cost functions

1999-02-01
Azizoğlu, Meral
Kirca, O
In this paper we consider unrelated parallel machine scheduling problems that involve the minimization of regular total cost functions. We first present some properties of optimal solutions and then provide a lower bound. These mechanisms are tested on the well-known practical problem of minimizing total weighted flow time on unrelated parallel machines. In doing so, we design a branch and bound algorithm incorporating the mechanisms derived for the general total cost function along with the ones derived specifically for the total weighted flow time criterion. Computational experience indicates that incorporating reduction and bounding mechanisms significantly improves the performance of the branch and bound algorithm.