工件相同且发送批数受限的供应链排序问题

工件完工后成批发送的供应链排序问题是从实际生产中提炼出来的，针对发送批数受限制，最小化生产费用及发送费用的情况，当工件的权重与加工时间均相等时，生产费用是关于发送批数的单调递减函数，进而根据二分搜索法可以得到最优的发送批数。因此问题是多项式时间可解的。

Supply Chain Scheduling with Same Jobs Based on Limited Delivery Times

This paper considers several scheduling problems where deliveries are made in batches with each batch delivered to the customer in a single shipment. Various scheduling costs, which are based on the limited delivery times of the jobs, are considered. The objective is to minimize the scheduling cost plus the delivery cost. When the jobs are same, with same processing time and same weight, production costs is decreasing function on the delivery times, but delivery cost is increasing function on the delivery times. Therefore, binary search is used to find the optimal delivery times, and the problem can be solved in polynomial times.