论文信息 - An algorithm for hoist scheduling problems

An algorithm for hoist scheduling problems

This paper proposes an algorithm for hoist scheduling problems in a flexible PCB electroplating line where there is no buffer among workstations. Due to its chemical process nature, the processing times have to be controlled within a specified range (i.e. between a maximum processing time and a minimum processing time). The product will become defective if this constant is violated. The objective is to maximize throughput with no defective product. The proposed algorithm schedules jobs entering the system based on the specified range of processing time. A simulation study shows that the proposed algorithm outperforms the basic algorithm that schedules jobs based on the minimum processing times.

Yuehwern Yih | Yuehwern Yih

[1] Yuehwern Yih,et al. Trace-driven knowledge acquisition (TDKA) for rule-based real time scheduling systems , 1990, J. Intell. Manuf..

[2] Yuehwern Yih,et al. ROBOT SCHEDULING IN A CIRCUIT BOARD PRODUCTION LINE:A HYBRID OR/ANN APPROACH , 1993 .

[3] I. B. Turksen,et al. Crane Scheduling Problems , 1981 .

[4] Herbert Moskowitz,et al. Integrating Neural Networks and Semi‐Markov Processes for Automated Knowledge Acquisition: An Application to Real‐time Scheduling* , 1992 .

[5] Lei Lei,et al. The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

[6] Hirofumi Matsuo,et al. Crane scheduling problem in a computer-integrated manufacturing environment , 1991 .

[7] Arne Thesen,et al. SEMI-MARKOV DECISION MODELS FOR REAL-TIME SCHEDULING , 1991 .

[8] Yuehwern Yih,et al. Learning real-time scheduling rules from optimal policy of semi-Markov decision processes , 1992 .

[9] Henry L. W. Nuttle,et al. Hoist Scheduling For A PCB Electroplating Facility , 1988 .