This paper studies a single-item lot-based supplying and batch production under a bilateral capacity reservation contract based on a partnership structure in which some suppliers, a manufacturer, and a third-party logistics provider are connected through long-term cooperation agreements. This configures a partnership supply chain and promotes the manufacturer’s performance in a continuous improvement cycle. Since in this paper, it is assumed that the products are perishable, there is not any inventory storage. Moreover, due to a settled contract, the final products are delivered by third-party logistics corporate providing vehicles according to the products’ features, their expiration time lengths, customers’ demands and other considerations in each period. Thus, the delivery batch size, which is equal to the vehicle capacity in a full truckload mode, is targeted for the manufacturer operations resulting in a dynamic improvement environment. In this problem, respect to the performance level of the manufacturer, in each period, a certain capacity is reserved at each selected supplier level according to the appointed batch deliveries. Here, in addition to the ordinary costs incurred due to ordering and delivery processes, some penalties are imposed for orders/delivers exceeding or falling behind the reserved capacity. After investigating the computational complexity of the problem, we propose three dynamic programming algorithm as well. Finally, numerical results and some potential future researches are presented.
Accepté le :
Première publication :
Publié le :
DOI : 10.1051/ro/2020099
Keywords: Supply chain management, batch-production, partnership supply, bilateral capacity reservation contract, dynamic programming algorithm
@article{RO_2021__55_S1_S2633_0,
author = {Rezaei, Saeid and Behnamian, Javad},
title = {Single-item lot-based supplying and batch production under a bilateral capacity reservation: {A} partnership structure},
journal = {RAIRO. Operations Research},
pages = {S2633--S2652},
year = {2021},
publisher = {EDP-Sciences},
volume = {55},
doi = {10.1051/ro/2020099},
mrnumber = {4223181},
zbl = {1479.90034},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2020099/}
}
TY - JOUR AU - Rezaei, Saeid AU - Behnamian, Javad TI - Single-item lot-based supplying and batch production under a bilateral capacity reservation: A partnership structure JO - RAIRO. Operations Research PY - 2021 SP - S2633 EP - S2652 VL - 55 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2020099/ DO - 10.1051/ro/2020099 LA - en ID - RO_2021__55_S1_S2633_0 ER -
%0 Journal Article %A Rezaei, Saeid %A Behnamian, Javad %T Single-item lot-based supplying and batch production under a bilateral capacity reservation: A partnership structure %J RAIRO. Operations Research %D 2021 %P S2633-S2652 %V 55 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2020099/ %R 10.1051/ro/2020099 %G en %F RO_2021__55_S1_S2633_0
Rezaei, Saeid; Behnamian, Javad. Single-item lot-based supplying and batch production under a bilateral capacity reservation: A partnership structure. RAIRO. Operations Research, Tome 55 (2021), pp. S2633-S2652. doi: 10.1051/ro/2020099
[1] , and , Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales. Int. J. Prod. Res. 49 (2011) 2551–2566. | Zbl | DOI
[2] and , The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases. Eur. J. Oper. Res. 229 (2013) 353–363. | MR | Zbl | DOI
[3] , , and , NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract. Eur. J. Oper. Res. 257 (2017) 483–493. | MR | Zbl | DOI
[4] , , and , General lot-sizing and scheduling for perishable food products. RAIRO:OR 54 (2020) 913–931. | MR | Zbl | Numdam | DOI
[5] , , and , Two-level uncapacitated lot-sizing problem considering the financing cost of working capital requirement. Front. Eng. Manage. (2020) 1–11.
[6] and , Computational complexity of the capacitated lot size problem. Manage. Sci. 28 (1982) 1174–1186. | MR | Zbl | DOI
[7] , , and , Single item lot sizing problems. Eur. J. Oper. Res. 168 (2006) 1–16. | MR | Zbl | DOI
[8] , , and , Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory. OR Spect. 37 (2015) 983–1006. | MR | Zbl | DOI
[9] , , and , Single-item dynamic lot-sizing problems: an updated survey. Eur. J. Oper. Res. 263 (2017) 838–863. | MR | Zbl | DOI
[10] and , A goal programming model for joint decision making of inventory lot-size, supplier selection and carrier selection. Comput. Ind. Eng. 71 (2014) 1–9. | DOI
[11] , , and , A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory. Comput. Ind. Eng. 64 (2013) 200–210. | DOI
[12] , and , Deterministic production planning: algorithms and complexity. Manage. Sci. 26 (1980) 669–679. | MR | Zbl | DOI
[13] and , The two-level lot-sizing problem with outbound shipment. Omega 90 (2020) 101997. | DOI
[14] , , and , Two-warehouse inventory model for deteriorating items with partial backlogging and advance payment scheme. RAIRO:OR 53 (2019) 1691–1708. | MR | Zbl | Numdam | DOI
[15] , , , and , Inventory system with expiration date: pricing and replenishment decisions. Comput. Ind. Eng. 132 (2019) 232–247. | DOI
[16] , , , and , Non-instantaneous deterioration effect in ordering decisions for a two-warehouse inventory system under advance payment and backlogging. Ann. Oper. Res. (2020) 1–33. | MR | Zbl
[17] , , , and , The effect of advance payment with discount facility on supply decisions of deteriorating products whose demand is both price and stock dependent. Int. Trans. Oper. Res. 27 (2020) 1343–1367. | MR | Zbl | DOI
[18] , Two NP-complete Problems in Nonnegative Integer Programming. Report No. 178, Computer Science Laboratory, Princeton University, NJ (1975).
[19] , and , A credit policy approach in a two-warehouse inventory model for deteriorating items with price-and stock-dependent demand under partial backlogging. J. Ind. Eng. Int. 15 (2019) 147–170. | DOI
[20] , and , Two-level lot-sizing with inventory bounds. Discrete Optim. 30 (2018) 1–19. | MR | Zbl | DOI
[21] , , , and , A two-warehouse EOQ model with interval-valued inventory cost and advance payment for deteriorating item under particle swarm optimization. Soft Comput. 23 (2019) 13531–13546. | DOI
[22] , Lot-sizing model with advance payment pricing and disruption in supply under planned partial backordering. Int. Trans. Oper. Res. 24 (2017) 783–800. | MR | Zbl | DOI
[23] , and , A lot sizing model with advance payment and planned backordering. Ann. Oper. Res. 271 (2018) 1001–1022. | MR | Zbl | DOI
[24] , Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math. Program. 108 (2006) 53–77. | MR | Zbl | DOI
[25] and , Dynamic version of the economic lot size model. Manage. Sci. 5 (1958) 89–96. | MR | Zbl | DOI
[26] , A backlogging model and a multi-echelon model of a dynamic economic lot size production system – a network approach. Manage. Sci. 15 (1962) 506–527. | Zbl | DOI
Cité par Sources :
