计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2010年
8期
205-207,231
,共4页
混合流水车间(HFS)%准时制%等待时间受限%约束满足优化
混閤流水車間(HFS)%準時製%等待時間受限%約束滿足優化
혼합류수차간(HFS)%준시제%등대시간수한%약속만족우화
Hybrid Flow Shop(HFS)%just in time%limited waiting time%constraint satisfaction optimization
针对等待时间受限的准时制混合流水车间调度问题,建立其约束满足优化模型.考虑到模型具有二元变量的复杂性特点,将原问题分解为多能力流水车间调度和机器指派两个子问题.在对多能力流水车间调度问题的约束满足优化求解过程中嵌入邻域搜索,从而提高算法的收敛性.数据实验表明模型和算法是可行和有效的.
針對等待時間受限的準時製混閤流水車間調度問題,建立其約束滿足優化模型.攷慮到模型具有二元變量的複雜性特點,將原問題分解為多能力流水車間調度和機器指派兩箇子問題.在對多能力流水車間調度問題的約束滿足優化求解過程中嵌入鄰域搜索,從而提高算法的收斂性.數據實驗錶明模型和算法是可行和有效的.
침대등대시간수한적준시제혼합류수차간조도문제,건립기약속만족우화모형.고필도모형구유이원변량적복잡성특점,장원문제분해위다능력류수차간조도화궤기지파량개자문제.재대다능력류수차간조도문제적약속만족우화구해과정중감입린역수색,종이제고산법적수렴성.수거실험표명모형화산법시가행화유효적.
A constraint satisfaction optimization model is established for the problem of just in time hybrid flowshop scheduling with limited waiting time.Considering the problem's complicated characteristic of having binary variables,this paper decomposes it into a Multiple Capacitated Flowshop Scheduling(MCFS)problem and a machine allocation problem.During the process of solving the MCFS problem,a local search is embedded into the procedure of constraint satisfaction optimization so as to improve the convergence of the algorithm.The data experiments show that both the model and algorithm are feasible and effective.