Scheduling Multiple Orders per Job with Multiple Constraints on Identical Parallel Machines  

作　　者：王腾 周炳海 

机构地区：[1]School of Mechanical Engineering,Tongji University

出　　处：《Journal of Donghua University(English Edition)》2013年第6期466-471,共6页东华大学学报（英文版）

基　　金：National Natural Science Foundations of China(No.61273035,No.71071115)

摘　　要：With a comprehensive consideration of multiple product types, past-sequence-dependent （ p-s-d ） setup times, and deterioration effects constraints in processes of wafer fabrication systems, a novel scheduling model of multiple orders per job（MOJ） on identical parallel machines was developed and an immune genetic algorithm（IGA） was applied to solving the scheduling problem. A scheduling problem domain was described. A non-linear mathematical programming model was also set up with an objective function of minimizing total weighted earliness-tardlness penalties of the system. On the basis of the mathematical model, IGA was put forward. Based on the genetic algorithm （GA）, the proposed algorithm （IGA） can generate feasible solutions and ensure the diversity of antibodies. In the process of immunization programming, to guarantee the algorithm＇s convergence performance, the modified rule of apparent tardiness cost with setups （ATCS） was presented. Finally, simulation experiments were designed, and the results indicated that the algorithm had good adaptability when the values of the constraints＇ characteristic parameters were changed and it verified the validity of the algorithm.With a comprehensive consideration of multiple product types,past-sequence-dependent(p-s-d) setup times,and deterioration effects constraints in processes of wafer fabrication systems,a novel scheduling model of multiple orders per job(MOJ)on identical parallel machines was developed and an immune genetic algorithm(IGA) was applied to solving the scheduling problem.A scheduling problem domain was described.A non-linear mathematical programming model was also set up with an objective function of minimizing total weighted earliness-tardiness penalties of the system.On the basis of the mathematical model,IGA was put forward.Based on the genetic algorithm(GA),the proposed algorithm(IGA) can generate feasible solutions and ensure the diversity of antibodies.In the process of immunization programming,to guarantee the algorithm's convergence performance,the modified rule of apparent tardiness cost with setups(ATCS) was presented.Finally,simulation experiments were designed,and the results indicated that the algorithm had good adaptability when the values of the constraints' characteristic parameters were changed and it verified the validity of the algorithm.

关 键 词：multiple product types past-sequence-dependent （ p-s-d ） setup times deterioration effects identical parallel machines scheduline ： immune Penetic algorithm （ IGA ） 

分 类 号：O223[理学—运筹学与控制论] TV697.11[理学—数学]