DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINE

被引：120

作者：

LEI, L

WANG, TJ

机构：

[1] Graduate School of Management, Rutgers University, Newark, NJ

来源：

IIE TRANSACTIONS | 1994年 / 26卷 / 02期

关键词：

D O I：

10.1080/07408179408966593

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the problem of determining a maximum throughput cyclic schedule for the operations of a material handling hoist in an automated electroplating line. The proposed algorithm applies a set of simple algebraic inequalities to derive candidate schedules and uses a branch-and-bound-based search process to identify the optimal one. Computational results with both benchmark and random test problems are presented.

引用

页码：25 / 33

页数：9

共 5 条

[1] THE MINIMUM COMMON-CYCLE ALGORITHM FOR CYCLIC SCHEDULING OF 2 MATERIAL HANDLING HOISTS WITH TIME WINDOW CONSTRAINTS [J].