批处理机生产与成批配送的协调调度研究

Study on Coordinated Scheduling of Batching Production and Batching Delivery

针对生产物流系统中的批处理特点,本文提炼出批处理机生产与产品成批配送的协调调度问题进行研究。目标函数为最小化总权重完成时间。首先基于计算复杂性理论,通过三划分问题的归约证明该问题是强NP难的。其次运用动态规划方法,分别对于工件加工顺序给定或生产分批给定的两种特殊情况提出多项式时间的最优算法。

For the features of batching in production-logistic system, this paper is expected to investigate coordinated batching schedule and batching delivery. The objective function here refers to minimizing aggregate weighting amount of completion time. It is proved that this problem is NP-hard. For the two special cases with a fixed job sequence and a given batching decision, the optimal algorithms are proposed by dynamic programming respective- ly.