Cyclic scheduling of a hoist with time window constraints

被引：129

作者：

Chen, HX ^{[1
]}

Chu, CB

Proth, JM

机构：

[1] Xian Univ, INRIA Lorraine, Syst Engn Inst, Xian, Peoples R China

[2] Univ Magdeburg, D-39106 Magdeburg, Germany

[3] Univ Technol Troyes, F-10010 Troyes, France

[4] INRIA Lorraine, F-57070 Metz, France

[5] Univ Maryland, Syst Res Inst, College Pk, MD 20742 USA

来源：

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1998年 / 14卷 / 01期

关键词：

Bi-valued graph; branch-and-bound; cycle time; hoist scheduling; time window constraints;

D O I：

10.1109/70.660860

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach and requires the solution of a specific class of linear programming problems (LPP's), These LPP's are equivalent to the problems of the cycle time evaluation in bi-valued graphs, Computational experience is presented to compare the results obtained using this new algorithm with the ones proposed in the literature.

引用

页码：144 / 152

页数：9

共 12 条

[1]

Baker KR., 1974, Introduction to Sequencing and Scheduling

[2] THE BASIC CYCLIC SCHEDULING PROBLEM WITH DEADLINES [J].

CHRETIENNE, P .

DISCRETE APPLIED MATHEMATICS, 1991, 30 (2-3) :109-123

[3]

CHRETIENNE P, 1984, THESIS U P M CURIE F

[4] Single machine scheduling with chain structured precedence constraints and separation time windows [J].

Chu, C ;

Proth, JM .

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1996, 12 (06) :835-844

[5]

HANEN C, 1993, 9330 LITP I B PASC P

[6]

LAWLER EL, 1989, BSR8909 CTR MATH COM

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

LEI, L ;

WANG, TJ .

MANAGEMENT SCIENCE, 1991, 37 (12) :1629-1639

[8]

LEI L, 1989, OPTIMAL CYCLIC SCHED

[9]

Lei L, 1989, PROOF CYCLIC HOIST S

[10]

MANIERLACOSTE MA, 1994, THESIS U FRANCHE COM

← 1 2 →