Global Journal of Business Management

Global Journal of Business Management ISSN 6731-4538 Vol. 7 (9), pp. 001-008, September, 2013. © International Scholars Journals

Full Length Research Paper

An optimal algorithm for type-I assembly line balancing problem with resource constraint

Hsiu-Hsueh Kao¹*, Din-Horng Yeh², Yi-Hsien Wang³ and Jui-Cheng Hung⁴

¹Department of Finance, Yuanpei University, No.306, Yuanpei St., Hsin-Chu 30015, Taiwan.

²Department of Business Administration, National Chung Cheng University, No.168, University Rd., Min-Hsiung Chia-Yi 62102, Taiwan.

³Department of Banking and Finance, Chinese Culture University, No.55, Hwa-Kang Road, Yang-Ming-Shan, Taipei 11114, Taiwan.

⁴Department of Finance, Lunghwa University of Science and Technology, No.300, Sec.1, Wanshou Rd., Guishan Shiang, Taoyuan County 33306, Taiwan.

Accepted 31 May, 2013

Abstract

In this paper we consider resource-constrained type-I assembly line balancing problem (RCALBP- I) in which resource of different types, such as machines and workers, are required in processing tasks. The objective of RCALBP-I is to minimize not only the number of workstations needed, but also the number of resource types required. A shortest route algorithm is proposed to find the optimal solution for RCALBP-I. An illustrative example is also given to show the effectiveness of the proposed algorithm.

Key words: Layout, line balancing, resource constraint, shortest route.