82
Views
54
CrossRef citations to date
0
Altmetric
Original Articles

An algorithm for hoist scheduling problems

Pages 501-516 | Received 01 Apr 1993, Published online: 16 May 2007
 

Abstract

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.