A linear programming approach to quaity improvement project and product mix selection under inspection error and rework

Download

index.pdf

Date

2006

Author

Şarbak, Nedret

Metadata

Show full item record

Item Usage Stats

165
views

72
downloads

In this study, the effect of inspection error on the product mix and quality projects selection in a manufacturing environment where rework and inspection errors exist is examined. It is assumed that the products (items) for which rework is necessary are reprocessed at a separate work center and 100% inspection is performed for the products both after rework and processing operations. Markov chain approach is used to compute yield and rework rates. In addition, nominal-the-best type of a quality loss function is used in computing quality loss due to products shipped to the customers. A linear programming (LP) model is developed to support the product mix and quality improvement project selection decisions. The use of LP model is demonstrated on an example problem. The results obtained under different experimental conditions are compared with solutions of a naive QI project selection method, improving the least capable process. The analysis shows that developed LP model is relatively better than process capability approach. Besides, according to the results obtained under different experimental conditions, the factors that have significant effect on throughput and QI project selection are being determined.

Subject Keywords

Production Management.

URI

http://etd.lib.metu.edu.tr/upload/3/12607495/index.pdf
https://hdl.handle.net/11511/16377

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Analysis of an inventory system with advance emand information and supply uncertainty Arıkan, Emel; Süral, Haldun; Department of Industrial Engineering (2005) In this study we address a periodic review capacitated inventory system with supply uncertainty where advance demand information is available. A stochastic dynamic programming formulation is applied with the objective of minimizing the expected inventory related costs over a finite horizon. Three different supply processes are assumed. Under the all-or-nothing type supply process and partially available supply process, the structure of optimal policy is proved to be a base stock policy and numerical example...
A new approach to generating non-permutation schedules for flowshops with missing operations Tabalu, Metin; Şen, Tayyar; Department of Industrial Engineering (2006) In this study, non-permutation flowshops with missing operations are considered. The primary performance criterion is the total cycle time (i.e. makespan) and the secondary criterion is the total flowtime. In order to obtain the schedule with minimum makespan and minimum total flowtime, non-permutation schedules are being generated instead of permutation ones by permitting multiple jobs bypassing stages where misisng operations occur. A heuristic algorithm has been developed in order to generate non-permuta...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals Korkmaz, Gediz; Kayalıgil, Sinan; Department of Industrial Engineering (2004) In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combinati...
A Remanufacturing system with imperfect sorting: deterministic and probabilistic models Tan, Merve; Bakal, İsmail Serdar; Yüksel Özkaya, Banu; Department of Industrial Engineering (2018) In this study, we focus on inaccurate sorting process with classification errors in a reverse supply chain comprising a remanufacturer and a collector under deterministic demand in a single time period. The collector acquires used items from end-users and the remanufacturer reproduces them to serve the deterministic demand of remanufactured products. There are two sources of uncertainty: uncertain quality of used items and uncertain quality of sorted items due to imperfect testing. Used items are categorize...

Citation Formats

N. Şarbak, “A linear programming approach to quaity improvement project and product mix selection under inspection error and rework,” M.S. - Master of Science, Middle East Technical University, 2006.