作　　者： ; ; ;

机构地区： 暨南大学管理学院

出　　处： 《系统科学与数学》 2010年第12期1622-1630,共9页

摘　　要： 考虑了由一个制造商和多个客户组成的供应链系统.每个客户有多个订单交给制造商加工,且每个客户有一个可以接受的完工订单到达时间.制造商可以与客户进行协商来选定合适的交货期.完工的订单是采用直接运输方式分批配送的,每一批配送需要花费一定的时间和费用.目标是对每个订单指派合适的交货期,并且进行生产和配送的排序,以极小化总的交货期指派费用,订单误工费用与配送费用的和.考虑了多种情况,分别给出了相应的算法. A supply chain with one manufacturer and multiple customers is considered. A set of orders needs to be processed by the manufacturer and to be delivered to the customers upon completion. Each customer has a specific acceptable lead time. The manufacturer assigns a due date for one order by negotiating with the customers. The problem is to assign appropriate due date for the orders, and find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total tardiness, due date assignment and delivery cost. We study the solvability of multiple cases of the problem by providing efficient algorithms.

关 键 词： 供应链排序 指派交货期 分批配送 动态规划

领　　域： [理学] [理学]