首页 | 本学科首页   官方微博 | 高级检索  
     

基于无等待约束的供应链在线调度问题
引用本文:常桂娟,张纪会. 基于无等待约束的供应链在线调度问题[J]. 复旦学报(自然科学版), 2007, 46(4): 510-516
作者姓名:常桂娟  张纪会
作者单位:青岛大学,复杂性科学研究所,青岛,266071;青岛农业大学,理学院,青岛,266109;青岛大学,复杂性科学研究所,青岛,266071
基金项目:国家自然科学基金 , 高等学校博士学科点专项科研项目 , 山东省泰山学者计划
摘    要:研究了供应链在线调度问题.给出了在不改变已有工件调度的情况下,最早完成临时订单的算法,该算法在寻优过程中结合了微粒群算法的局部搜索能力,计算机仿真结果表明,在大规模订单的情况下,该算法同样能很快找到最优加工方案.

关 键 词:在线调度  供应链  实时  微粒群优化算法
文章编号:0427-7104(2007)04-0510-07
修稿时间:2007-06-21

On-line Supply Chain Scheduling Problems Based on No-wait Constraint
CHANG Gui-juan,ZHANG Ji-hui. On-line Supply Chain Scheduling Problems Based on No-wait Constraint[J]. Journal of Fudan University(Natural Science), 2007, 46(4): 510-516
Authors:CHANG Gui-juan  ZHANG Ji-hui
Abstract:On-line supply chain scheduling problems were considered when customers release jobs to a manufacturer that has to process the jobs.There is not any information about the coming order such as the order quantity,release,and processing time,etc.The objective is to minimize the makespan.An algorithm combining with the local search ability of particle swarm optimization algorithm(PSO) during searching optimal solution is proposed.The simulation results show that the optimal solution can be obtained rapidly without changing the other jobs' schedule.
Keywords:on-line scheduling  supply chain  real-time  particle swarm optimization algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号