Dynamic Multi-Product Procurement with Joint and Individual Setup Costs: Theory and Insights

2021 ◽  
Author(s):  
Xiangyin Kong ◽  
Yimin Yu ◽  
Huihui Wang
Keyword(s):  
2019 ◽  
Vol 4 (2) ◽  
pp. 205-214
Author(s):  
Erika Fatma

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.


2017 ◽  
Vol 107 (04) ◽  
pp. 282-287
Author(s):  
F. Engehausen ◽  
H. Prof. Lödding

Viele Unternehmen nutzen Rüstzyklen, um Rüstaufwände bei besonders reihenfolgeabhängigen Rüstzeiten zu verringern und nehmen dafür höhere Bestände und Durchlaufzeiten in Kauf. Rüstzykluskennlinien gestatten es, diesen Zielkonflikt zu modellieren und übersichtlich darzustellen. Dieser Fachartikel erklärt, welche Größen einen besonderen Einfluss auf den Verlauf der Kennlinien haben und wie diese in die Modellierung integriert werden.   In the case of sequence-dependent setup times many companies use setup cycles to reduce setup costs accepting higher WIP levels and throughput times. Logistic operating curves for setup cycles enable the illustration of this trade-off and a logistic positioning. This article explains which variables have a particular influence on the characteristics of the operating curves and how they are integrated into the modeling.


Author(s):  
Zahedi Zahedi

This study developed a model of batch scheduling involving the unavailability machine to minimize setup costs, cost of preventive maintenance and the cost of rework in a stable machine. This model is considered necessary in order to understand the effect of the unavailability machine for production runs and to understand the effect on the batch production schedule. The results of this study indicate that the first and last run will not give single batch. Given a hypothetical example of how the model and algorithm developed solve the problem instance. 


1999 ◽  
Author(s):  
Shouri Yasui ◽  
Kazutoshi Sakai

Abstract The benefits of hardturning include reduced setup costs; shorter tool change times; improved squareness by virtue of the ability to machine cylinder I.D., O.D. and face in one chucking; low energy consumption and elimination of the need to handle grinding sludge and waste fluid. Hardturning has typically been used as a replacement for grinding, in the processing of fitting surfaces or clad surfaces, and other such relatively straightforward applications not requiring sliding. In recent years, however, due to advances in servo and other machine technology, and tool material improvements (CBN, ceramics), hardturning has entered the realm of finishing curved and complex shaped surfaces that have sliding and rolling contacts. This paper will present the machine characteristics developed to meet the ever increasing demand for hardturning process accuracy, and introduce each of the factors which ultimately affected the design of machine components, providing examples where appropriate.


2020 ◽  
Vol 144 ◽  
pp. 102134
Author(s):  
Emmanuel Hyon ◽  
Alain Jean-Marie
Keyword(s):  

2007 ◽  
Vol 24 (02) ◽  
pp. 223-243 ◽  
Author(s):  
SRINIVAS R. CHAKRAVARTHY

We consider a multi-server queueing model in which arrivals occur according to a Markovian arrival process (MAP). There is a single-server and additional (backup) servers are added or removed depending on sets of thresholds. The service times are assumed to be exponential and the servers are assumed to be homogeneous. A comparison of this model to the classical MAP/M/c queueing model through an optimization problem yields some interesting results that are useful in practical applications. For example, we notice that positively correlated arrival process appears to benefit with the threshold type queueing model. We also give the minimum delay costs and the associated maximum setup costs so that the threshold type queueing model is to be preferred over the classical MAP/M/c model.


1998 ◽  
Vol 111 (3) ◽  
pp. 543-554 ◽  
Author(s):  
Igor Averbakh ◽  
Oded Berman ◽  
Zvi Drezner ◽  
George O. Wesolowsky

Sign in / Sign up

Export Citation Format

Share Document