EFFECTIVE HEURISTICS FOR MAKESPAN MINIMIZATION IN PARALLEL BATCH MACHINES WITH NON-IDENTICAL CAPACITIES AND JOB RELEASE TIMES

被引：5

作者：

Jia, Zhao-Hong ^{[1
]}

Wen, Ting-Ting ^{[1
]}

Leung, Joseph Y. -T. ^{[2
,3
]}

Li, Kai ^{[2
,3
]}

机构：

[1] Anhui Univ, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230039, Anhui, Peoples R China

[2] Hefei Univ Technol, Sch Management, Hefei 230009, Anhui, Peoples R China

[3] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA

来源：

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2017年 / 13卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Parallel batch machines; non-identical machine capacities; release times; non-identical job sizes; makespan; heuristics; MINIMIZING MAKESPAN; PROCESSING MACHINE; DETERIORATING JOBS; SIZES; ALGORITHMS; CRITERIA;

D O I：

10.3934/jimo.2016057

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the problem of scheduling a set of n jobs with arbitrary job sizes, processing times and release times on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. We first present an algorithm to compute a lower bound for the optimal makespan. Based on different rules of batching the jobs and assigning the batches to the machines, several heuristics are proposed to solve the problem. The performance of the proposed heuristics is evaluated by computational experiments. The proposed heuristics are compared against the lower bound and against each other. Our results show that the one of the proposed algorithms outperforms all the other heuristics.

引用

页码：977 / 993

页数：17

共 50 条

[1] Metaheuristics for scheduling jobs with incompatible families on parallel batching machines [J].