작업 군이 존재하는 개별공정 일정계획 문제에 대한 시뮬레이티드 어닐링 알고리듬

Jae-Min Yu, Dong-Ho Lee · 대한산업공학회 추계학술대회 논문집 · 2008

This paper addresses the scheduling problem for job shops in which jobs are grouped into job families for further assembly operations, but processed individually. The job shops considered in this paper can be found in various production systems, especially in remanufacturing shops that process parts or components obtained after disassembling used or end-of-life products. The main decision is the sequence of the jobs assigned to each machine, which is the same as that of the ordinary job shop scheduling problem. To minimize the deviations of the job completion times within each job family, the objective is set to minimizing the sum of the maximum family flow times. To describe the problem mathematically, an integer programming model is presented. Then, according to different neighborhood generation methods, we suggest several annealing algorithms. Computational experiments were performed on various test problems and the results are reported.

Cited by 2 works.

Authors

References