Models of synchronous production lines with no intermediate buffers

Download
2010
Çetinay, Hande
Production lines with unreliable machines have received a great amount of attention in the literature. Especially, two-station systems have mostly been studied because such systems are easier to handle when compared to the longer lines. In literature, longer lines are usually evaluated by a decomposition algorithm, whereby the long line is partitioned into chunks of two-station lines. Decomposition algorithms require intermediate buffer storages of capacity at least two or three. The trends in modern manufacturing practices, on the other hand, such as the Toyota Production System, dictate that intermediate storages be eliminated. Our work studies multi-station lines with no intermediate storage. We develop software to automate the generation of transition probability matrices to allow the analysis of system behavior. The algorithm allows the use of software packages to handle computations and to solve for exact solutions. Long-run behavior is obtained via the algorithm developed in the computational environment MATLAB. The purpose is to analyze the system performance measures such as starvation and blockage times of stations, production rate and work-in-process. In addition, the production rate and the work-in-process measures over failure and repair probabilities are curve-fit to establish simple and useful empirical formulas for lines consisting three, four and five identical stations. Numerical analyses show that the proposed algorithm is effective for exact solutions and the suggested formulas are valid for approximate solutions.

Suggestions

A linear programming approach to quaity improvement project and product mix selection under inspection error and rework
Şarbak, Nedret; Köksal, Gülser; Department of Industrial Engineering (2006)
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 functi...
Evolutionary algorithms for deterministic and stochastic unconstrained function optimization
Koçkesen, Talip Kerem; Özdemirel, Nur Evin; Department of Industrial Engineering (2004)
Most classical unconstrained optimization methods require derivative information. Different methods have been proposed for problems where derivative information cannot be used. One class of these methods is heuristics including Evolutionary Algorithms (EAs). In this study, we propose EAs for unconstrained optimization under both deterministic and stochastic environments. We design a crossover operator that tries to lead the algorithm towards the global optimum even when the starting solutions are far from t...
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...
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...
Two-sided assembly line balancing models and heuristics
Arıkan, Uğur; Kırca, Ömer; Department of Industrial Engineering (2009)
This study is focused on two-sided assembly line balancing problems of type-I and type-II. This problem is encountered in production environments where a two-sided assembly line is used to produce physically large products. For type-I problems, there is a specified production target for a fixed time interval and the objective is to reach this production capacity with the minimum assembly line length used. On the other hand, type-II problem focuses on reaching the maximum production level using a fixed assem...
Citation Formats
H. Çetinay, “Models of synchronous production lines with no intermediate buffers,” M.S. - Master of Science, Middle East Technical University, 2010.