Profit-oriented disassembly line balancing with stochastic task times in hybrid lines

Download

index.pdf

Date

2013

Author

Gümüşkaya, Volkan

Metadata

Show full item record

Item Usage Stats

82
views

28
downloads

We offer a solution approach for profit-oriented disassembly line balancing problem in hybrid lines with stochastic task times. When task times are stochastic, there is a probability that some of the tasks are not completed within the predefined cycle time. For task incompletions, the most commonly used remedial actions are stopping the line or offline repairs. Stopping the line is to stop the line until the incomplete tasks are completed, while in offline repair, incomplete tasks are completed in an offline area after the workpiece leaves the line. In a hybrid line, both of the remedial actions are implemented for two task classes: (F)inish and (P)ass tasks. The classification of tasks have significant effect on the costs incurred by line stoppages or offline repairs, which together make up incompletion costs. In this thesis, we propose a greedy algorithm, which makes this classification for a given cycle time and task assignment so as to maximize the expected profit of one product disassembled. We also propose a cost calculation method to calculate expected incompletion costs.

Subject Keywords

Production management., Manufacturing processes., Assembly-line methods.

URI

http://etd.lib.metu.edu.tr/upload/12616314/index.pdf
https://hdl.handle.net/11511/24580

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Disassembly line balancing with limited supply and subassembly availability Altekin, FT; Kandiller, L; Özdemirel, Nur Evin (2003-10-30) Disassembly line balancing problem (DLBP) aims at finding a feasible assignment of disassembly tasks to workstations such that precedence relations among tasks are satisfied and some measure of effectiveness is optimized. We consider partial disassembly under limited supply of a single product as well as availability of its subassemblies. Hence, in satisfying the demand for revenue generating parts, both discarded products and available subassemblies can be utilized. We assume that part revenues and demand,...
Workload smoothing in assembly lines İmat, Sadullah; Azizoğlu, Meral; Department of Industrial Engineering (2014) In this thesis, we consider a simple assembly line balancing problem with fixed number of workstations and predefined cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads from the cycle time. We first present pure integer nonlinear programming model and then convert the model into mixed integer linear program. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study ...
Dissimilarity maximization method for real-time routing of parts in random flexible manufacturing systems Saygin, C; Kilic, SE (Springer Science and Business Media LLC, 2004-04-01) This paper presents a dissimilarity maximization method (DMM) for real-time routing selection and compares it via simulation with typical priority rules commonly used in scheduling and control of flexible manufacturing systems (FMSs). DMM aims to reduce the congestion in the system by selecting a routing for each part among its alternative routings such that the overall dissimilarity among the selected routings is maximized. In order to evaluate the performance of DMM, a random FMS, where the product mix is...
Convolutional Inverse Problems in Imaging with Convolutional Sparse Models Dogan, Didem; Öktem, Sevinç Figen (2019-06-24) We develop a fast reconstruction method with convolutional sparse models for general inverse problems involving convolutions. The effectiveness of the reconstruction method is demonstrated for an inverse problem in computational spectral imaging.
Multi-objective integer programming: A general approach for generating all non-dominated solutions Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16) In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...

Citation Formats

V. Gümüşkaya, “Profit-oriented disassembly line balancing with stochastic task times in hybrid lines,” M.S. - Master of Science, Middle East Technical University, 2013.