A Research on Job-Shop Scheduling in Stochastic Rework and Reprocessing Situation
Chen Jian-guo
Shu Hui
Yu Ping-xiang
Abstract：A Job-Shop scheduling is addressed with the consideration of stochastic rework and reprocessing while the traditional Job-Shop mathematical model ignored it .The objective of the model is to minimize the Total Weighted Tardiness (TWT) in these job shops.To solve the problem, a modified genetic algorithm is proposed with coding and population initialization improved .Five groups of population data for simula-tion experiments show that compared with the traditional genetic algorithm , the improved algorithm is better in convergence speed and the target value of TWT .Finally, through simulating the instances of scheduling scheme , and comparing with the actual Job-Shop scheduling results , the TWT of model simulation is less than 46%of the actual project scheduling results , and the scheduling scheme model proves practical and effective.
Keywords：Job-Shop schedulingrework and reprocessingtotal weighted tardinessmodified genetic al-gorithm
Publication Date：2015-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 127-133,147 )