Supply Chain Batching Problem with Identical Orders and Lifespan

摘要: In the real world, there are a large number of supply chains that involve short lifespan products. this paper, we consider an integrated production and distribution batch scheduling problem on single machine for orders with lifespan, because it may be cheaper or faster to process distribute in than them individually. Assume have identical processing time come from same location, setup is constant. The choose batches sizes minimize total delivery without violating order lifespan. We first give backward dynamic programming algorithm, but not actually polynomial-time algorithm. Then propose constant partial algorithm by doing further research into recursion formula Further, using difference characteristics optimal value function, specific calculating solve being integer times obtained.