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

DOI10.1016/S0377-2217(03)00024-9zbMath1056.90004OpenAlexW1993854062MaRDI QIDQ1429932

Mikkel T. Jensen, Moutaz J. Khouja

Publication date: 27 May 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00024-9

zbMATH Keywords

InventoryGlobal optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Inventory, storage, reservoirs (90B05)

Related Items (5)

An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy ⋮ A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case ⋮ A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains ⋮ Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point ⋮ Economical production and transshipment policy for coordinating multiple production sites

Cites Work

• The Economic Lot Scheduling Problem (ELSP): Review and Extensions

This page was built for publication: An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem.