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

自由作业的供应链排序研究
引用本文:陈荣军,唐国春. 自由作业的供应链排序研究[J]. 数学的实践与认识, 2011, 41(1)
作者姓名:陈荣军  唐国春
作者单位:1. 常州工学院数学系,江苏常州213002;上海第二工业大学管理工程研究所,上海201209
2. 上海第二工业大学管理工程研究所,上海,201209
基金项目:国家自然科学基金重大国际(地区)合作研究项目,江苏省教育厅项目,江苏省青蓝工程资助项目
摘    要:研究一类集成工件加工和发送的供应链排序模型,即研究如何安排工件在自由作业机器上加工,把加工完毕的工件分批发送给下游客户,使得含生产排序费用和发送费用的目标函数最优.这里,分别取工件最大送到时间和平均送到时间为生产排序费用;而发送费用是由固定费用和与运输路径有关的变化费用组成.利用排序理论和动态规划方法,构造了自由作业供应链排序问题的多项式时间近似算法,并分析算法的性能比.

关 键 词:供应链  排序  自由作业  近似算法

Supply Chain Schedeuling with Open-Shop Problem
CHEN Rong-jun,TANG Guo-chun. Supply Chain Schedeuling with Open-Shop Problem[J]. Mathematics in Practice and Theory, 2011, 41(1)
Authors:CHEN Rong-jun  TANG Guo-chun
Abstract:In this paper,we study a class of supply chain scheduling model of integrated production and distribution operations.In this model,a set of jobs are first scheduled and processed in the processing facility of open-shop machines and then delivered to the customers directly in batches.The problem is to find a joint schedule of production and distribution such that an objective function that takes into account both production cost and distribution cost is optimized,where production cost is measured by the maximum delivery time and by the average delivery time of jobs,respectively,and the distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment.Using scheduling theories and dynamic programming, we construct for supply chain scheduling with open-shop problem heuristic algorithms with worst-case performance analysis.
Keywords:supply chain  scheduling  open-shop  heuristic algorithm
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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