• Journal of Korea Society of Industrial Information Systems
• /
• v.1 no.1
• /
• pp.29-62
• /
• 1996

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.131-145
• /
• 1993

This paper deals with scheduling problem of the chemical process system where aircraft parts go through a given sequence of tanks filled with chemical solutions. The system has two hoists which move carriers holding the parts between tanks. A mixed integer programming model is developed from which a maximum throughput schedule can be found for the hoist movements. To show the validity of the model, a real world problem is solved and the results are compared with those with an existing approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.3
• /
• pp.173-181
• /
• 2016

This paper deals with the single-hoist and multiple-products scheduling problem. Although a mixed integer linear programming model for the problem was developed earlier, a branch-and-bound based heuristic algorithm is proposed in this paper to solve the big-size problems in real situation. The algorithm is capable of handling problems incorporating different product types, jobs in the process, and tank capacities. Using a small example problem the procedure of the heuristic algorithm is explained. To assess the performance of the heuristic we generate a bigger example problem and compare the results of the algorithm proposed in this paper with the optimal solutions derived from the mathematical model of earlier research. The comparison shows that the heuristic has very good performance and the computation time is sufficiently short to use the algorithm in real situation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.7
• /
• pp.205-214
• /
• 2021

For smart manufacturing, most semiconductor sites utilize automated material handling systems(AMHS). As one of the AMHSs, the OHT control system(OCS) manages overhead hoist transports(OHT) that move along rails installed on the ceiling. This paper proposes a real-time scheduling system to efficiently allocate and control the OHTs in semiconductor logistics processes. The proposed system, as an independent subsystem within the OCS, is interconnected with the main subsystem of the OCS, so that it can be easily modified without the effect of other systems. To develop the system, we first identify the functional requirements of the semiconductor logistics process and classify several types of control scenarios of the OHTs. Next, based on SEMI(Semiconductor Equipment and Materials International) standard, we design sequence diagrams and interface messages between the subsystems. The developed system is interoperated with the OCS main subsystem and the database in real time and performs two major roles: 1) OHT dispatching and 2) pathfinding. Six integrated tests were carried out to verify the functions of the developed system. The system was normally operated on six basic scenarios and two exception scenarios and we proved that it is suitable for the mission planning of the OHTs.