Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 52, No. 4, July-August 2004, pp. 639-654
DOI: 10.1287/opre.1040.0121
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Li, C.-L.
Right arrow Articles by Xiao, W.-Q.
Right arrow Search for Related Content

Dynamic Lot Sizing with Batch Ordering and Truckload Discounts

Chung-Lun Li, Vernon Ning Hsu, Wen-Qiang Xiao

Department of Logistics, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
School of Management, George Mason University, Fairfax, Virginia 22030
Graduate School of Business, Columbia University, New York, New York 10027

lgtclli{at}polyu.edu.hk
vhsu{at}gmu.edu
wx2004{at}columbia.edu

This paper studies two important variants of the dynamic economic lot-sizing problem that are applicable to a wide range of real-world situations. In the first model, production in each time period is restricted to a multiple of a constant batch size, where backlogging is allowed and all cost parameters are time varying. Several properties of the optimal solution are discussed. Based on these properties, an efficient dynamic programming algorithm is developed. The efficiency of the dynamic program is further improved through the use of Monge matrices. Using the results developed for the first model, an O(n3log n) algorithm is developed to solve the second model, which has a general form of product acquisition cost structure, including a fixed charge for each acquisition, a variable unit production cost, and a freight cost with a truckload discount. This algorithm can also be used to solve a more general problem with concave cost functions.

Subject classifications: inventory/production; dynamic lot sizing; quantity discount; dynamic programming; applications.
History: Received July 2002; revision received April 2003; revision received July 2003; accepted July 2003.




This article has been cited by other articles:


Home page
Management ScienceHome page
M. C. Gurbuz, K. Moinzadeh, and Y.-P. Zhou
Coordinated Replenishment Strategies in Inventory/Distribution Systems
Management Science, February 1, 2007; 53(2): 293 - 307.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.