摘要
针对一个制造商和一个客户组成的供应链,考虑工件有交货期限约束且不允许延迟送达客户处,对平行机加工环境下的供应链排序问题进行了研究。为了实现从日常调度层面对工件加工和工件分批运送进行集成优化,首先,以运送所有工件的总运输成本最小化为目标,构建了问题的混合整数规划模型;然后,分析了问题的复杂性并针对工件的交货期限相同和工件的交货期限不同两种情形分别设计了多项式时间的启发式算法进行求解;最后,通过仿真实验验证了所提算法的有效性。
This paper studied a supply chain scheduling problem on parallel machines. In this problem,the supply chain consisted of a manufacturer and a customer. The manufacturer should process and delivery a set of independent jobs placed by the customer,each of which must be completed before or at its deadline. To make an integrated schedule on processing and batch delivering these jobs at the detailed scheduling level,this paper firstly formulated a mixed integer programming model to minimize the total transportation cost. Then,it analyzed the complexity of the problem and proposed two polynomial time heuristics to solve the cases with common deadline and unique deadlines for jobs. Finally,the experiment result shows the effectiveness of the proposed algorithm.
出处
《计算机应用研究》
CSCD
北大核心
2016年第6期1686-1688,1716,共4页
Application Research of Computers
基金
高等学校博士学科点专项科研基金资助项目(20100032110034)
新世纪优秀人才支持计划资助项目(NCET-06-0236)
关键词
供应链排序
交货期
平行机
混合整数规划
启发式算法
supply chain scheduling
deadline
parallel machine
mixed integer program
heuristic algorithm
