|
|
Journal of Korean Society for Quality Management 1989;17(1): 35-. |
| 준비시간이 종속적인 n/M 스케쥴링 문제의 휴리스틱 알고리듬(I) |
| 최성운1, 노인규2 |
1경원대학교 산업공학과
2한양대학교 산업공학과 |
| A Development of Heuristic Algorithms for the Multi-stage Manufacturing Systems with Sequence Dependent Setup Times |
| Seong-Un Choe1, In-Gyu No2 |
1
2 |
|
|
|
|
|
| ABSTRACT |
|
This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{ imes}3{ imes}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level. |
|
|
|
PDF Links
Full text via DOI 
Download Citation 
