An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem

An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20052031
Country: Netherlands
Volume: 156
Issue: 2
Start Page Number: 305
End Page Number: 311
Publication Date: Jul 2004
Journal: European Journal of Operational Research
Authors: ,
Keywords: optimization
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.