Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

被引：5

作者：

Hidri, Lotfi ^{[1
]}

机构：

[1] King Saud Univ, Dept Ind Engn, Coll Engn, POB 800, Riyadh 11421, Saudi Arabia

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2016年 / 182卷

关键词：

Hybrid Flowshop Scheduling Problem with; Multiprocessor Tasks; Lower bounds; ALGORITHM;

D O I：

10.1016/j.ijpe.2016.10.001

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this note the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks is addressed. The objective function to be minimized is the maximum completion time or the makespan. The main purpose of this note is to pinpoint an inaccuracy contained in a recent paper while developing a lower bound (Chou: IJPE, 141:137-145) and to propose some valid lower bounds.

引用

页码：531 / 534

页数：4

共 8 条

[1] Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks [J].