A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

被引：12

作者：

Lee, HC ^{[1
]}

Guignard, M ^{[1
]}

机构：

[1] UNIV PENN,PHILADELPHIA,PA 19104

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1996年 / 47卷 / 10期

关键词：

scheduling; Lagrangean decomposition; Lagrangean relaxation;

D O I：

10.1057/palgrave.jors.0471004

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lagrangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.

引用

页码：1247 / 1261

页数：15

共 19 条

[1] PREEMPTIVE SCHEDULING OF HYBRID PARALLEL MACHINES [J].