摘要
研究了供应链在线调度问题.该问题具有工件无等待、工序之间存在运输时间、加工时间介于一个区间等特点,制造商随时可能接到顾客订单,订单到达前,所有信息如订单数量、到达时间及加工时间等均未知.研究了在不改变已有工件调度的情况下,使用资源的可用时间区间最早完成临时订单的算法.计算机仿真表明,使用该算法求解大规模临时订单问题是十分有效的.
This paper considers on-line supply chain scheduling problems which is characterized by no-wait, transfer time between operations, processing time between two positive limits, etc. Manufacturer may receive orders from customers at any moment. There is no any information about the coming orders such as the orders quantity, release and processing time, etc. The paper gives an algorithm which can complete the orders within the time confined by available resources without changing other jobs＇ schedule. The simulation results show the effectiveness of the algorithm for solving large-scale order.
出处
《控制与决策》
EI
CSCD
北大核心
2008年第10期1092-1097,1102,共7页
Control and Decision
基金
国家自然科学基金项目(70671057,70771052)
教育部博士点基金项目(20051065002)
山东省泰山学者计划
青岛农业大学高层次人才启动基金
关键词
在线调度
供应链
微粒群
实时
On-line scheduling
Supply chain
Particle swarm optimization
Real-time
