An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem
The previous algorithm for solving the economic lot and delivery scheduling problem does not guarantee a globally optimal solution. In this paper, we develop a polynomial time algorithm which guarantees a globally optimal solution to the problem. We provide some insights into problem parameters for which the previous algorithm provides sub-optimal solutions.
global optimization inventory