EPTAS for load balancing problem on parallel machines with a non-renewable resource

被引：0
|
作者：
Jaykrishnan, G. [1 ]
Levin, Asaf [1 ]
机构：
[1] Technion, Fac Data & Decis Sci, Haifa, Israel
来源：
DISCRETE OPTIMIZATION | 2023年 / 48卷
基金：
以色列科学基金会;
关键词：
Scheduling; Approximation schemes; Non-renewable resource; SCHEDULING PROBLEMS; APPROXIMATION SCHEMES; UNIFORM PROCESSORS; APPROXIMABILITY; ALGORITHMS; NUMBER; TIME; JOBS;
D O I：
10.1016/j.disopt.2023.100775
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The problem considered is the non-preemptive scheduling of independent jobs that consume a resource (which is non-renewable and replenished regularly) on parallel uniformly related machines. The input defines the speed of machines, size of jobs, the quantity of the resource required by the jobs, the replenished quantities, and replenishment dates of the resource. Every job can start processing only after the required quantity of the resource is allocated to the job. The objective function is a generalization of makespan minimization and minimization of the lp-norm of the vector of loads of the machines. We present an EPTAS for this problem. Prior to our work only a PTAS was known in this non-renewable resource settings only for the special case of our problem of makespan minimization on identical machines.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数：21
相关论文
共 50 条
12345