Lot sizing problem with multi-mode replenishment and batch delivery

被引:17
作者
Akbalik, Ayse [1 ]
Rapine, Christophe [1 ]
机构
[1] Univ Lorraine, LCOMS, Technopole Metz, Metz, France
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2018年 / 81卷
关键词
Lot sizing; Multi-mode; Batch delivery; Approximation algorithm; Polynomial time algorithm; SUPPLIER SELECTION PROBLEM; MONOTONE COST-STRUCTURE; QUANTITY DISCOUNTS; ALGORITHMS; TIME; FPTAS; MODEL; SIZE;
D O I
10.1016/j.omega.2017.10.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the single-item uncapacitated lot sizing problem with multi-mode replenishment and batch deliveries (ULS-MMB). Specifically, we consider that each replenishment mode has a Full Truck Load (FTL) cost structure and incurs a fixed ordering cost plus a fixed cost per batch. This problem arises in practice when a retailer places the order with different suppliers in each period. We show that this problem is NP-hard even for a single period and under very restricted cost parameters. We then show that ULS-MMB can be transformed into a lot sizing problem with only one replenishment mode per period, that is, ULS-MMB is a special case of lot-sizing with time-varying batch sizes. This simple observation allows us to improve some results already known in the literature of multi-mode replenishment. We propose a very efficient 2-approximation algorithm and establish that the problem admits an FPTAS. Finally, we show that the problem restricted to two modes with divisible batch sizes can be solved in polynomial time. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:123 / 133
页数:11
相关论文
共 22 条
[1]  
Ahuja RA., 1993, NETWORK FLOWS THEORY
[2]   Supplier selection and order lot sizing modeling: A review [J].
Aissaoui, Najla ;
Haouari, Mohamed ;
Hassini, Elkafi .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (12) :3516-3540
[3]   Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs [J].
Akbalik, A. ;
Pochet, Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (02) :412-434
[4]   The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases [J].
Akbalik, Ayse ;
Rapine, Christophe .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (02) :353-363
[5]   Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost [J].
Akbalik, Ayse ;
Rapine, Christophe .
OPERATIONS RESEARCH LETTERS, 2012, 40 (05) :390-397
[6]   Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures [J].
Bai Q.-G. ;
Xu J.-T. .
Journal of Applied Mathematics and Computing, 2011, 37 (1-2) :331-345
[7]   Inventory lot-sizing with supplier selection [J].
Basnet, C ;
Leung, JMY .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (01) :1-14
[8]   A fast and simple algorithm for the money changing problem [J].
Boecker, Sebastian ;
Liptak, Zsuzsanna .
ALGORITHMICA, 2007, 48 (04) :413-432
[9]   Joint decision of procurement lot-size, supplier selection, and carrier selection [J].
Choudhary, Devendra ;
Shankar, Ravi .
JOURNAL OF PURCHASING AND SUPPLY MANAGEMENT, 2013, 19 (01) :16-26
[10]   An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure [J].
Chubanov, S ;
Kovalyov, MY ;
Pesch, E .
MATHEMATICAL PROGRAMMING, 2006, 106 (03) :453-466