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

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.

Share this article

Awards Nomination

Select your language of interest to view the total content in your interested language

Indexed In
  • Index Copernicus
  • Sherpa Romeo
  • Open J Gate
  • Academic Keys
  • CiteFactor
  • Electronic Journals Library
  • OCLC- WorldCat
  • Eurasian Scientific Journal Index
  • Rootindexing
  • Academic Resource Index