This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them consiedred only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

Abstract
 1. 서 론
 2. 논의 대상 주문생산시스템
 3. 납기와 기계 이용률을 고려한 작업순서의 결정
  3.1 작업 순서의 결정 절차
 4. 수치예제 및 결과 분석
 5. 결 론 및 향후과제
 참고문헌

• 김정(안산공과대학교 산업경영과)