원문정보
An Integer Programming Model for Generalized Assembly Line Balancing Problems
초록
영어
This paper considers the design problem of assembly lines which are flow oriented production system suitable for mass production. Sine the installation of an assembly line is a midlong-term decision and usually requires large capital investments, it is important that such a system is optimally designed. The simple assembly line balancing problem(SALBP) is allocating tasks to workstations under the cycle time(sum of task times) constraint of each workstation and precedence constraints between tasks. In addition to the basic constraints of SALBP, the generalized assembly line balancing problem(GALBP) considers assignment restrictions such as incompatibilities between tasks, resource(operator) related workstation restriction, etc. The purpose of this paper is to introduce a new integer programming model for GABLP. We propose mild constraints and task-task/task-workstation relationship matrices. these are useful for presenting and solving GALBP as more realistic form.
목차
Ⅱ. 고정 제약 정수계획 모형
Ⅲ. 유연 제약 정수계획 모형
Ⅳ. 적용 예제
Ⅴ. 결론
참고문헌
Abstract