Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

0.00 Avg rating0 Votes
Article ID: iaor2009245
Country: Netherlands
Volume: 179
Issue: 2
Start Page Number: 302
End Page Number: 315
Publication Date: Jun 2007
Journal: European Journal of Operational Research
Authors: , ,
Abstract:

This research investigates the problem of scheduling jobs on a set of parallel machines where the speed of the machines depends on the allocation of a secondary resource. The secondary resource is fixed in quantity and is to be allocated to the machines at the start of the schedule. The scheduling objective is to minimize the number of tardy jobs. Two versions of the problem are analyzed. The first version assumes that the jobs are pre-assigned to the machines, while the second one takes into consideration the task of assigning jobs to the machines. The paper proposes an Integer Programming formulation to solve the first case and a set of heuristics for the second.

Reviews

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