A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

DOI10.1057/JORS.1989.55MaRDI QIDQ3818780zbMATH OpenOpenAlexFDO

Authors Frank P. Buffa, Joseph R. Munn

Publication date 1989

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1989.55

zbMATH Keywords

relaxationreorder cycle-timeshipping costtotal logistics cost

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• Algorithm of logistic cost minimization under constraints on supply volumes
• Exact algorithms for the order picking problem
• An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem.
• Efficient algorithms for the joint replenishment problem with minimum order quantities
• An algorithm for dynamic order-picking in warehouse operations
• A fast polynomial time algorithm for logistics network flows
• A fast heuristic for minimising total average cycle stock subject to practical constraints
• scientific article; zbMATH DE number 1488161
• Approximation algorithms for replenishment problems with fixed turnover times
• Approximation algorithms for replenishment problems with fixed turnover times

Cited in

(2)

• Optimal lot size model for deteriorating items with demand rate dependent on displayed stock level (DSL) and partial backordering
• Optimization of a price break policy and advertisement effort based non-instantaneous deteriorating inventory problem with partial backlogged via metaheuristic algorithms

This page was built for publication: A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818780)