Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959842 | European Journal of Operational Research | 2017 | 34 Pages |
Abstract
In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. The availability of resources is limited and fixed throughout the production horizon. The objective considered is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature. The other one, which is based on the resemblance to strip packing problems, is an original contribution of this paper. As the models presented are incapable of solving medium-sized instances to optimality, we propose three matheuristic strategies for each of these two models. The algorithms proposed are tested over an extensive computational experience. Results show that the matheuristic strategies significantly outperform the mathematical models.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Luis Fanjul-Peyro, Federico Perea, Rubén Ruiz,