Parallel machine scheduling problems considering regular measures of performance and machine cost

Parallel machine scheduling problems considering regular measures of performance and machine cost

0.00 Avg rating0 Votes
Article ID: iaor20103439
Volume: 61
Issue: 5
Start Page Number: 849
End Page Number: 857
Publication Date: May 2010
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: parallel machines
Abstract:

This research considers a broad range of scheduling problems in the parallel machines environment. Schedules are evaluated according to two independent components of the objective function: (1) machine cost consisting of a fixed cost and a variable cost; and (2) a regular measure of performance. This study is only one of a few that take the selection of machines among those available as a decision variable. For machine cost with concave functions, we derive the general characteristics of optimal solutions with respect to decisions on the number of machines to use and the way to load the machines. Our analysis is not restricted to the machine cost criterion, but may be extended to other measures with concave functions. Furthermore, we provide a Pareto efficient perspective in understanding the tradeoff between machine cost and any regular measure of performance.

Reviews

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