Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475516 | Computers & Operations Research | 2007 | 22 Pages |
Abstract
In this paper we consider the parallel machine scheduling problem with dual resource constraints with the objective of minimizing the maximum completion time. We develop heuristics that combine list-scheduling and bin-packing approaches with rules to iteratively modify the flexible resource allocation. A lower bound is presented and the previous and proposed solution approaches to the problem are analyzed under a variety of experimental conditions, demonstrating that there are advantages to the proposed heuristics.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alex J. Ruiz-Torres, Grisselle Centeno,