PSO Based Job-shop Scheduling Method with Constraint
Job-shop scheduling is an important problem that need to be solved urgently in actual production.It is usually hard to achieve the optimal solution with classical methods due to its high computational complexity (NP-Hard).According to the character of job-shop scheduling problem,some constraint conditions in actual production are considered while Job-shop scheduling model based on PSO is presented in the paper.Coding methods of PSO,the target function,fitness value and Parameter setting were proposed in this paper.And the software system of the job-shop scheduling is developed according to the PSO algorithm.Simulation results show that the proposed algorithm illustrate that the PSO algorithm presented is effective approach to solve the Job-shop scheduling problem.
Job-shop scheduling .Particle Swarm Optimizer(PSO) coding Constraint
Xu zhiwei Liu yongxian liu xiaotian
School of Mechanical Engineering & Automation,Northeastern University,Shenyang 110004,China
国际会议
International Conference on Modelling,Identification and Control(模拟、鉴定、控制国际会议)
上海
英文
2008-06-29（万方平台首次上网日期，不代表论文的发表时间）