Scholars Central

Research articlePublished 31 May 2013

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

Authors: Hsiu-Hsueh Kao, Din-Horng Yeh, Yi-Hsien Wang, Jui-Cheng Hung

Global Journal of Business and Management

Volume 7 · Issue 9 · Pages 1–8

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Global Journal of Business and Management.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalGlobal Journal of Business and Management
  • SubjectBusiness & Management
  • BylineArticles whose byline prints “Hsiu-Hsueh Kao”
  • BylineArticles whose byline prints “Din-Horng Yeh”
  • BylineArticles whose byline prints “Yi-Hsien Wang”
  • BylineArticles whose byline prints “Jui-Cheng Hung”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels