您的位置:首页  > 论文页面

一种给多个客户配送工件的供应链排序问题

发表时间:2013-01-15  浏览量:1640  下载量:656
全部作者: 陈锐,张玉忠,陈立忠
作者单位: 曲阜师范大学管理学院
摘 要: 将车辆配送计划放入单机生产模型中一并考虑,目标函数是确定工件在车间的加工顺序和配送顺序,使得带有不同权重的工件到达客户的总加权完工时间之和最小。对于该问题在车辆进行直接运输和间接运输的情形下,考虑车辆有无容量限制的几种情况。对于这几种特殊情形,分别给出多项式时间算法,并分析各自的时间复杂性。
关 键 词: 运筹学;供应链排序;动态规划算法;时间复杂性
Title: A supply chain scheduling problem of delivering jobs to multiple customer locations
Author: CHEN Rui, ZHANG Yuzhong, CHEN Lizhong
Organization: Management School, Qufu Normal University
Abstract: This paper incorporates the delivery plan of a vehicle into a single manufacturing facility model. The objective is to determine the job processing sequence in the plant together with the delivery schedule so as to minimize the total job weighted arrival times. For the case of the problem in the condition of vehicles with direct and indirect transport, several conditions with that whether the vehicle has capacity limit are considered. We develop a polynomial time algorithm and analyze time complexity in each case for some special cases of this problem.
Key words: operational research; supply chain scheduling; dynamic programming algorithm; time complexity
发表期数: 2013年1月第1期
引用格式: 陈锐,张玉忠,陈立忠. 一种给多个客户配送工件的供应链排序问题[J]. 中国科技论文在线精品论文,2013,6(1):60-65.
 
0 评论数 0
暂无评论
友情链接