%0 Journal Article
%T Free search algorithm for scheduling single batch processing machine with non-identical job sizes<br>基于自由搜索算法求解单机差异工件批调度问题*
%A WU Guang-hui
%A CHEN Hua-pingb
%A <br>吴光辉
%A 陈华平b
%J 计算机应用研究
%D 2010
%I 
%X Research on free search algorithm for minimize the makespan on a single batch-processing machine with non-identical job sizes. For the discrete optimization problem and the disadvantage of free search algorithm, this paper combined real-coded genetic algorithm with free search algorithm. Propounded a hybrid free search algorithm including two crosser operators and elitist strategy. The simulation results demonstrate that the proposed algorithm outperforms other algorithms.
%K scheduling
%K batch processing machine
%K non-identical job sizes
%K free search(FS)<br>调度
%K 批处理机
%K 差异工件
%K 自由搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=151BC083C6FBD1A71DEF5939EF9FB8CC&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=5D311CA918CA9A03&sid=529FE73EEAC55063&eid=EB7EEF6BE1238237&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13