加工时间离散可控的分批配送排序问题
BATCH DELIVERY SCHEDULING WITH DISCRETELY CONTROLLABLE PROCESSING TIMES
研究了工件的加工时间是离散可控的, 并且工件加工完后需要分批配送到客户的单机排序问题. 一个客户在初始时刻将一批工件交给一个制造商进行加工. 每个工件有多种加工模式, 分配给每个工件的加工资源越多, 则其加工时间越短. 工件生产完后需要分批配送到客户处, 每一批需要花费一定的时间和费用. 研究了排序理论中主要的四个目标函数, 构建了单机情况下的具体模型, 分析了问题的复杂性, 对具体的问题给出了它们的最优算法.
In this paper, we consider the single machine scheduling problems with discretely controllable processing times and batch delivery. A customer places some jobs to a manufacturer at the planning horizon. Each job has multiple processing modes. If we allocate more processing resources to some job, its processing time is becoming shorter. Processed jobs are delivered in batches to their customer, Each shipment incurs a delivery cost and takes a fixed amount of time. We consider four objective functions in scheduling theory, construct the models in single machine environment, analyze the problem complexity and give optimal algorithms to solve the problems.
供应链排序 / 加工时间离散可控 / 分批配送 / 动态规划. {{custom_keyword}} /
/
〈 | 〉 |