Lot-Sizing Models Using Multi-dimensional Clearing Functions

2020 ◽  
pp. 221-237
Author(s):  
Hubert Missbauer ◽  
Reha Uzsoy
Keyword(s):  
Lot Sizing ◽  
Clearing Functions

MINIMALISASI BIAYA SIMPAN DAN BIAYA SETUP PADA MULTIPLE PRODUK: SIMULASI DENGAN CAPACITATED LOT SIZING PROBLEM

2019 ◽  
Vol 4 (2) ◽  
pp. 205-214
Author(s):  
Erika Fatma
Keyword(s):  
Production Cost ◽  
Lot Sizing ◽  
Setup Time ◽  
Production Costs ◽  
Total Production ◽  
Product Cycle ◽  
Lot Size ◽  
Setup Costs ◽  
Lot Sizing Problem ◽  
Capacitated Lot Sizing

Lot sizing problem in production planning aims to optimize production costs (processing, setup and holding cost) by fulfilling demand and resources capacity costraint. The Capacitated Lot sizing Problem (CLSP) model aims to balance the setup costs and inventory costs to obtain optimal total costs. The object of this study was a plastic component manufacturing company. This study use CLSP model, considering process costs, holding costs and setup costs, by calculating product cycle and setup time. The constraint of this model is the production time capacity and the storage capacity of the finished product. CLSP can reduce the total production cost by 4.05% and can reduce setup time by 46.75%.  Keyword: Lot size, CLSP, Total production cost.

scholarly journals A Model for Demand Planning in Supply Chains with Congestion Effects

Logistics ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 3
Author(s):  
Uday Venkatadri ◽  
Shentao Wang ◽  
Ashok Srinivasan
Keyword(s):  
Supply Chains ◽  
Capacity Planning ◽  
Demand Management ◽  
Capacity Limitations ◽  
Demand Planning ◽  
Clearing Functions ◽  
Order Promising ◽  
Linear Aggregate ◽  
Inner Approximation ◽  
Congestion Effects

This paper is concerned with demand planning for internal supply chains consisting of workstations, production facilities, warehouses, and transportation links. We address the issue of how to help a supplier firmly accept orders and subsequently plan to fulfill demand. We first formulate a linear aggregate planning model for demand management that incorporates elements of order promising, recipe run constraints, and capacity limitations. Using several scenarios, we discuss the use of the model in demand planning and capacity planning to help a supplier firmly respond to requests for quotations. We extend the model to incorporate congestion effects at assembly and blending nodes using clearing functions; the resulting model is nonlinear. We develop and test two algorithms to solve the nonlinear model: one based on inner approximation and the other on outer approximation.

Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences

2021 ◽  
pp. 107176
Author(s):  
Fernanda F. Alves ◽  
Thiago H. Nogueira ◽  
Mauricio C. de Souza ◽  
Martín G. Ravetti
Keyword(s):  
Lot Sizing ◽  
Lot Sizing And Scheduling ◽  
Joint Resolution
Sign in / Sign up

Export Citation Format

Share Document