Minimizing the weighted number of tardy jobs on parallel processors

Minimizing the weighted number of tardy jobs on parallel processors

0.00 Avg rating0 Votes
Article ID: iaor20053072
Country: Netherlands
Volume: 160
Issue: 2
Start Page Number: 471
End Page Number: 484
Publication Date: Jan 2005
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: branch and bound
Abstract:

We present a branch-and-bound algorithm to minimize the weighted number of tardy jobs on either identical or non-identical processors. Bounds come from a surrogate relaxation resulting in a multiple-choice knapsack. Extensive computational experiments indicate problems with 400 jobs and several machines can be solved quickly. The results also indicate what parameters affect solution difficulty for this algorithmic approach.

Reviews

Required fields are marked *. Your email address will not be published.