An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem [An article from: European Journal of Operational Research]

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.