Abstract

We study a logistics scheduling problem where a manufacturer receives raw materials from a supplier, manufactures products in a factory, and delivers the finished products to a customer. The supplier, factory and customer are located at three different sites. The objective is to minimize the sum of work-in-process inventory cost and transport cost, which includes both supply and delivery costs. For the special case of the problem where all the jobs have identical processing times, we show that the inventory cost function can be unified into a common expression for various batching schemes. Based on this characteristic and other optimal properties, we develop an O( n) algorithm to solve this case. For the general problem, we examine several special cases, identify their optimal properties, and develop polynomial-time algorithms to solve them optimally.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call