本文選題：排序　切入點：配送費用　出處：《運籌學(xué)學(xué)報》2017年03期

【摘要】：研究了單機環(huán)境下生產(chǎn)與配送的協(xié)同排序問題.有多個工件需要在一臺機器上進行加工,加工完的工件需要分批配送到一個客戶.每批工件只能在固定的幾個配送時刻出發(fā),不同的配送時刻對應(yīng)著不同的配送費用.我們的目標是找到生產(chǎn)與配送的協(xié)同排序,極小化排序的時間費用與配送費用的加權(quán)和.研究了排序理論中主要的四個目標函數(shù),構(gòu)建了單機情況下的具體模型,分析了問題的復(fù)雜性,對于配送費用單調(diào)非增的情況給出了它們的最優(yōu)算法.
[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.
【作者單位】： 曲阜師范大學(xué)管理學(xué)院;
【基金】：國家自然科學(xué)基金(No.71471101) 山東省自然科學(xué)基金(Nos.ZR2015GZ009,2014ZRB019TM) 曲阜師范大學(xué)科技計劃項目(No.xkj201505)
【分類號】：O223
，

本文編號：1720310