An improved algorithm for parallel machine scheduling under additional resource constraints

被引:1
|
作者
Zhang, An [1 ]
Zhen, Tan [1 ]
Chen, Yong [1 ]
Chen, Guangting [2 ]
机构
[1] Hangzhou Dianzi Univ, Dept Math, Hangzhou 310018, Peoples R China
[2] Zhejiang Univ Water Resources & Elect Power, Hangzhou 310018, Peoples R China
关键词
Resource constraints; Parallel machines; Approximation algorithm; Performance analysis; IDENTICAL MACHINES; DEDICATED MACHINES; CLASSIFICATION; MAKESPAN;
D O I
10.1007/s11590-022-01928-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a classic machine scheduling problem under resource constraints. Given m parallel identical machines and a collection of additional but renewable resources, each task requires both a machine and one particular resource at any time of its processing. The goal is to allocate the machines and resources to the tasks so as to minimize the makespan, that is, the maximum completion time of all tasks. Because of NP-hardness of the problem, we design a three-stage combinatorial algorithm with performance ratio 2m+2/m+3 that improves the best prior ratio for m >= 3 machines and ties with that for m = 2 machines.
引用
收藏
页码:753 / 769
页数:17
相关论文
共 50 条