An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

被引：23

作者：

Leung, Janny M. Y. ^{[1
]}

Levner, Eugene

机构：

[1] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China

[2] Holon Acad Inst Technol, Dept Comp Sci, IL-58102 Holon, Israel

来源：

OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 04期

关键词：

hoist-scheduling; partially-ordered sets; PCB manufacturing; cyclic schedules; polynomial algorithms;

D O I：

10.1016/j.orl.2005.07.010

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider no-wait production processes, where identical products are processed sequentially on n machines and transported by programmable hoists. We present an O(n(5)) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：465 / 472

页数：8

共 18 条

[1]

AIZENSHTAT VS, 1963, DOKLADY BYELORUSSIAN, V7, P224

[2]

Cameron P., 1994, COMBINATORICS TOPICS

[3] Cyclic scheduling in robotic flowshops [J].