A Scheduling Heuristic Alogorithm for Flexible Manufacturing Systems

자동생산체제(自動生産体制)(FMS)에서의 생산일정계획(生産日程計劃)

  • 노인규 (한양대학교 공과대학 산업공학과) ;
  • 최정상 (한양대학교 공과대학 산업공학과)
  • Published : 1988.06.30

Abstract

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

Keywords