Enumerative Search for Crane Schedule in Anodizing Operations

Authors: Kanate Pantusavase, Jaramporn Hassamontr

Abstract:

This research aims to develop an algorithm to generate a schedule of multiple cranes that will maximize load throughputs in anodizing operation. The algorithm proposed utilizes an enumerative strategy to search for constant time between successive loads and crane covering range over baths. The computer program developed is able to generate a near-optimal crane schedule within reasonable times, i.e. within 10 minutes. Its results are compared with existing solutions from an aluminum extrusion industry. The program can be used to generate crane schedules for mixed products, thus allowing mixed-model line balancing to improve overall cycle times.

Keywords: Crane scheduling, anodizing operations, cycle time minimization.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1107329

References:

[1] R. W. Lieberman and I. B. Turksen, “Crane scheduling problem,” AIIE Transaction, vol. 13, pp. 304-311, 1981.
[2] R. W. Lieberman and I. B. Turksen, “Two-operation crane scheduling problems,” IIE Transactions, vol. 14, pp. 146-155, 1982.
[3] L. Lei, and T.-J. Wang, “The minimum-common cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints,” Management Sciences, vol. 37(12), pp. 1629-1639, 1991.
[4] Y. Yih, “An algorithm for hoist scheduling problems,” International Journal of Production Research, vol. 32(3), pp. 501-516, 1994.
[5] P. GE, J. Wang, M. Jin, P. Ren, and H. Gao, “An efficient heuristic algorithm for overhead crane scheduling operations in workshop,” Applied Mathematics & Information Sciences, vol. 6-3S, pp. 1087-1094, 2012.
[6] C. A. Floudas, and X. Lin, “Continuous-time versus discrete-time approaches for scheduling of chemical process: a review,” Computer and Chemical Engineering, vol. 28, pp. 2109-2129, 2004.
[7] F. Blomer, and H. O. Gunther, “Scheduling of a multi-product batch process in the chemical process industry,” Computer in Industry, vol. 36, pp. 245-259, 2004.
[8] N. G. Hall, C. Sriskandarajah, “A survey of machine scheduling problems with blocking and no wait in process,” Operations Research, vol. 44, pp. 510-525, 1996.
[9] C. F. Daganzo, “The crane scheduling problem,” Transportation Research, vol. 23B, pp. 159-175, 1989.
[10] R. I. Peterkofsky, and C. F. Daganzo, “A branch and bound solution method for the crane scheduling problem,” Transportation Research, vol. 24B, pp. 159-172, 1990.
[11] K. H. Kim, and K. C. Moon, “Berth scheduling by simulated annealing,” Transportation Research Part B, vol. 37, pp. 541–560, 2003.
[12] H. Matsuo, J. S. Shang, and R. S. Sullivan “A crane scheduling problem in a computer integrated manufacturing environment,” Management Science, vol. 37, pp. 587-606, 1991.