On EOQ cost models with arbitrary purchase and transportation costs
Author(s) -
Ş. İlker Birbil,
Kerem Bülbül,
J. B. G. Frenk,
Henry Martyn Mulder
Publication year - 2015
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2015.11.1211
Subject(s) - economic order quantity , mathematical optimization , schedule , computer science , holding cost , minification , order (exchange) , fixed cost , transportation theory , set (abstract data type) , upper and lower bounds , total cost , class (philosophy) , unit cost , operations research , mathematics , economics , supply chain , microeconomics , programming language , mathematical analysis , finance , artificial intelligence , political science , law , operating system
We analyze an economic order quantity cost model with unit out-of-pocket holding costs, unit opportunity costs of holding, fixed ordering costs, and general purchase-transportation costs. We identify the set of purchase-transportation cost functions for which this model is easy to solve and related to solving a one-dimensional convex minimization problem. For the remaining purchase-transportation cost functions, when this problem becomes a global optimization problem, we propose a Lipschitz optimization procedure. In particular, we give an easy procedure which determines an upper bound on the optimal cycle length. Then, using this bound, we apply a well-known technique from global optimization. Also for the class of transportation functions related to full truckload (FTL) and less-than-truckload (LTL) shipments and the well-known carload discount schedule, we specialize these results and give fast and easy algorithms to calculate the optimal lot size and the corresponding optimal order-up-to-level
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom