주문생산방식을 따르는 조립시스템에서의 생산계획 및 일정계획을 위한 알고리듬

Algorithms for Production Planning and Scheduling in an Assembly System Operating on a Make-to-Order Basis

  • 박문원 (전북대학교 산업공학과) ;
  • 김영대 (한국과학기술원 산업공학과)
  • 투고 : 19971000
  • 발행 : 1998.09.30

초록

This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.

키워드