期刊
COMPUTERS & OPERATIONS RESEARCH
卷 40, 期 7, 页码 1829-1841出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2013.01.018
关键词
Iterated greedy; Unrelated parallel machines; Large-scale optimisation; Scheduling
类别
资金
- Spanish Government [TIN2012-37930-C02-01/02]
- Andalusian Regional Government [P08-TIC-4173]
In this work, we tackle the problem of scheduling a set of jobs on a set of unrelated parallel machines with minimising the total weighted completion times as performance criteria. The iterated greedy metaheuristic generates a sequence of solutions by iterating over a constructive heuristic using destruction and construction phases. In the last few years, iterated greedy has been employed to solve a considerable number of problems. This is because it is based on a very simple principle, it is easy to implement, and it often exhibits an excellent performance. Moreover, scalability for high-dimensional problems becomes an essential requirement for modern optimisation algorithms. This paper proposes an iterated greedy model for the above-mentioned scheduling problem to tackle large-size instances. The benefits of our proposal in comparison to existing metaheuristics proposed in the literature are experimentally shown. (C) 2013 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据