Supply chain scheduling with deadlines
This paper considers a make-to-order production-distribution system with one supplier and multiple customers. A set of orders with deadlines needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of three cases of the problem by providing efficient algorithms.
supply chain scheduling dynamic programming
Lei Wang Guoqing Wang
Department of Business Administration Jinan University Guangzhou, PR China
国际会议
成都
英文
662-665
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）