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.
WANG Lei
, WANG Guoqing
, YI Yuyin. , {{custom_author.name_en}}.
Supply Chain Scheduling with Due Date Assignment. Journal of Systems Science and Mathematical Sciences, 2010, 30(12): 1622-1630 https://doi.org/10.12341/jssms09435