CAJ | 학술논문

文章提出了解决流水作业调度问题的改进快速进入启发式算法。这种改进算法遵循原算法中构造双机子问题的基本思想，将原线性权重改进为指数权重并用Johnson双机算法进行求解。改进算法的性能使用了来自文献的实例测试，并与原算法进行比较。比较结果表明，在大规模工件的调度问题中改进算法优于原算法。
문장제출료해결류수작업조도문제적개진쾌속진입계발식산법。저충개진산법준순원산법중구조쌍궤자문제적기본사상，장원선성권중개진위지수권중병용Johnson쌍궤산법진행구해。개진산법적성능사용료래자문헌적실례측시，병여원산법진행비교。비교결과표명，재대규모공건적조도문제중개진산법우우원산법。
The paper presents a modified rapid access heuristic to solve the flowshop scheduling problems. This new heuristic follows the fundamental idea of the original rapid access approach by forming a two-machine subproblem, but the processing times are determined by using an exponential weighting modifier for the original linear weighting scheme without additional computational effort, then the sub problem is solved by using Johnson’s two-achine algorithm. The performance of modified heuristic is tested using instances from the literature and compared with the performance of the original rapid access (RA). Results show that the modified heuristic outperforms the original RA in large size problems by using specific value of pa-rameter alpha.