具有可变配送费用和固定配送时刻的单机排序问题

发布时间：2018-04-07 18:15

  本文选题：排序　切入点：配送费用　出处：《运筹学学报》2017年03期

【摘要】：研究了单机环境下生产与配送的协同排序问题.有多个工件需要在一台机器上进行加工,加工完的工件需要分批配送到一个客户.每批工件只能在固定的几个配送时刻出发,不同的配送时刻对应着不同的配送费用.我们的目标是找到生产与配送的协同排序,极小化排序的时间费用与配送费用的加权和.研究了排序理论中主要的四个目标函数,构建了单机情况下的具体模型,分析了问题的复杂性,对于配送费用单调非增的情况给出了它们的最优算法.
[Abstract]:The collaborative scheduling of production and distribution in a single machine environment is studied.There are multiple jobs to be processed on one machine, and the finished workpieces need to be distributed to a customer in batches.Each batch of jobs can only set out at a fixed number of delivery times, and different delivery times correspond to different distribution costs.Our goal is to find out the coordinated scheduling of production and distribution, and minimize the weighted sum of time cost and distribution cost.In this paper, the four main objective functions in sorting theory are studied, the concrete model of single machine is constructed, the complexity of the problem is analyzed, and their optimal algorithms are given for the case of monotonous and non-increasing distribution cost.
【作者单位】： 曲阜师范大学管理学院;
【基金】：国家自然科学基金(No.71471101) 山东省自然科学基金(Nos.ZR2015GZ009,2014ZRB019TM) 曲阜师范大学科技计划项目(No.xkj201505)
【分类号】：O223
，

本文编号：1720310