Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348251 | Computers & Operations Research | 2012 | 9 Pages |
Abstract
⺠The paper studies two generalizations of the unrelated parallel machines scheduling problem. ⺠Simple local search heuristics are proposed. ⺠Computational and statistical analyses show the superiority of the presented approach.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Luis Fanjul-Peyro, Rubén Ruiz,