Cyclic scheduling of a hoist with time window constraints

Author

Chen, Haoxun ; Chu, Chengbin ; Proth, Jean-marie

Author_Institution

Syst. Eng. Inst., Xi´´an Univ., China

Volume

14

Issue

1

fYear

1998

fDate

2/1/1998 12:00:00 AM

Firstpage

144

Lastpage

152

Abstract

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). These LPP 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

Keywords

coating techniques; electroplating; graph theory; hoists; materials handling; optimisation; printed circuit manufacture; production control; LP; PCB electroplating facility; bi-valued graphs; branch-and-bound algorithm; cycle time evaluation; hoist moves; linear programming; optimal cyclic schedules; printed circuit board; time window constraints; Chemicals; Computer industry; Iterative algorithms; Job shop scheduling; Linear programming; Materials handling; Printed circuits; Processor scheduling; Scheduling algorithm; Time factors;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.660860

Filename

660860