Solving Cost-Driven Job-shop Scheduling Problem by Hybrid Scatter Search

摘要：

Cost optimization has been an attractive and critical subject for both academic and industrial societies.This paper presents a cost-driven model of the job-shop scheduling problem and a new hybrid optimization algorithm to solve it.The cost model is developed in terms of a combination of multi-dimensional costs generated from product transitions,revenue loss,earliness / tardiness penalty,and so on.The new hybrid optimization algorithm combines the strong global search ability of scatter search with the strong local search ability of simulated annealing.In order to illustrate the effectiveness of the hybrid method,several test problems are generated,and the performance of the proposed method is compared with other evolutionary algorithms.The experimental simulation tests show that the hybrid method is quite effective at solving the cost-driven JSP.

关键词： Cost-Driven Job-shop Scheduling Problem Scatter Search Simulated Annealing

作者: Sun Kai Yang Gen-ke

作者单位: Department of Automation,Shanghai Jiao Tong University,Shanghai,China

会议类型: 国际会议

会议名称: International Conference on Modelling,Identification and Control(模拟、鉴定、控制国际会议)

会议地点: 上海

会议语种:英文

在线出版日期: 2008-06-29（万方平台首次上网日期，不代表论文的发表时间）