Lot sizing with quality improvement and setup time reduction

1999 ◽  
Vol 113 (3) ◽  
pp. 568-574 ◽  
Author(s):  
József Vörös
Keyword(s):  
Quality Improvement ◽  
Lot Sizing ◽  
Setup Time ◽  
Time Reduction

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.

One-stop breast clinic waiting-time reduction– a Quality improvement project (QIP)

2018 ◽  
Vol 44 (6) ◽  
pp. 917-918
Author(s):  
Raman Vinayagam ◽  
Denise Mason ◽  
Rajaram Burrah ◽  
Shabbir Poonawala ◽  
Maria Callaghan ◽  
...  
Keyword(s):  
Quality Improvement ◽  
Waiting Time ◽  
Quality Improvement Project ◽  
Breast Clinic ◽  
Improvement Project ◽  
One Stop ◽  
Time Reduction

scholarly journals Study on column generation for the lot-sizing and scheduling problem with sequencedependent setup time

2018 ◽  
Vol 189 ◽  
pp. 06002
Author(s):  
Dandan Zhang ◽  
Canrong Zhang
Keyword(s):  
Lot Sizing ◽  
Setup Time ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Capacitated Lot Sizing ◽  
Sequence Dependent Setup ◽  
Lot Sizing And Scheduling

The capacitated lot-sizing and scheduling problem with sequence-dependent setup time and carryover setup state is a challenge problem in the semiconductor assembly and test manufacturing. For the problem, a new mixed integer programming model is proposed, followed by exploring its relative efficiency in obtaining optimal solutions and linearly relaxed optimal solutions. On account of the sequence-dependent setup time and the carryover of setup states, a per-machine Danzig Wolfe decomposition is proposed. We then build a statistical estimation model to describe correlation between the optimal solutions and two lower bounds including the linear relaxation solutions, and the pricing sub-problem solutions of Danzig Wolfe decomposition, which gives insight on the optimal values about information regarding whether or not the setup variables in the optimal solution take the value of 1, and the information is further used in the branch and select procedure. Numerical experiments are conducted to test the performance of the algorithm.

A CASE STUDY OF SETUP TIME REDUCTION FOR PRODUCT CUSTOMIZATION

2016 ◽  
Author(s):  
Ana Luísa Ferreira Andrade Ramos ◽  
José António Vasconcelos Ferreira ◽  
Fábio Bernardes
Keyword(s):  
Setup Time ◽  
Product Customization ◽  
Time Reduction
Sign in / Sign up

Export Citation Format

Share Document