Approximation algorithms for scheduling unrelated parallel machines with release dates

被引:0
|
作者
Avdeenko, T. V. [1 ]
Mesentsev, Y. A. [1 ]
Estraykh, I. V. [1 ]
机构
[1] Novosibirsk State Tech Univ, 20,Karla Marksa Ave, Novosibirsk 630073, Russia
关键词
MAKESPAN;
D O I
10.1088/1742-6596/803/1/012007
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.
引用
收藏
页数:6
相关论文
共 50 条