Multi-product lot-sizing with a transportation capacity reservation contract - Production, manufacturing and logistics

被引:47
作者
van Norden, L
de Velde, SV
机构
[1] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, NL-2600 GA Delft, Netherlands
[2] Erasmus Univ, Rotterdam Sch Management, NL-3000 DR Rotterdam, Netherlands
关键词
logistics; inventory models; multi-product lot-sizing; integer linear programming; Lagrangean relaxation;
D O I
10.1016/j.ejor.2003.04.008
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Although transportation costs can form more than 50% of the total logistics costs of a product, they are often neglected in lot-sizing research and modelling. Nonetheless, the body of research that does take transportation costs into account is gradually growing. The bulk of this type of research, however, assumes that freight rates decrease as shipping weights and/or volumes increase. Inspired by the situation with a large European manufacturing company, we study a multi-product lot-sizing model where, in any period, any portion of a reserved transportation capacity can be used in exchange for a guaranteed price. If the capacity is insufficient, then the shipper needs to contract additional transportation capacity on the spot market, where the prevailing price is higher. Accordingly, the freight rates are piece-wise linearly increasing in our model. We prove that the problem of determining transportation lot-sizes so as to meet warehouse demand with no backlogging allowed and to minimize total costs, that is, the sum of inventory carrying, ordering, and transportation costs, is NP-hard in the strong sense. Furthermore, we present a Lagrangean relaxation algorithm to compute lower and upper bounds, of which comprehensive computational experiments show the compelling performance in terms of quality and speed. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:127 / 138
页数:12
相关论文
共 22 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]   COMPUTATIONAL-COMPLEXITY OF UNCAPACITATED MULTI-ECHELON PRODUCTION PLANNING PROBLEMS [J].
ARKIN, E ;
JONEJA, D ;
ROUNDY, R .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :61-66
[3]   Exact and heuristic solutions for a shipment problem with given frequencies [J].
Bertazzi, L ;
Speranza, MG ;
Ukovich, W .
MANAGEMENT SCIENCE, 2000, 46 (07) :973-988
[4]  
Bertazzi L., 1999, NEW TRENDS DISTRIBUT
[5]   Economic lot size model for price-dependent demand under quantity and freight discounts [J].
Burwell, TH ;
Dave, DS ;
Fitzpatrick, KE ;
Roy, MR .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (02) :141-155
[6]  
Carter J. R., 1996, Production and Inventory Management Journal, V37, P58
[7]   Stock replenishment and shipment scheduling for vendor-managed inventory systems [J].
Çetinkaya, S ;
Lee, CY .
MANAGEMENT SCIENCE, 2000, 46 (02) :217-232
[8]   Lot sizing and scheduling - Survey and extensions [J].
Drexl, A ;
Kimms, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 99 (02) :221-235
[9]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[10]  
FLEISCHMANN B, 1999, NEW TRENDS DISTRIBUT