Assembly Line Balancing with Task Paralleling

Download

index.pdf

Date

2004

Author

Kaplan, Özlem

Metadata

Show full item record

Item Usage Stats

261
views

108
downloads

In this study, we consider single model deterministic Assembly Line Balancing problem with task paralleling. The objective is to minimize the total cost which is composed of station opening cost and task dependent equipment cost. A branch and bound algorithm that allows two-level task paralleling is proposed. A heuristic algorithm is also developed both for obtaining efficient upper bounds to branch and bound and for achieving good approximate solutions for large sized problems. Computational experiments are conducted to investigate the effects of experimental parameters on the cost-related and algorithm-related performance measures. The exact algorithm results are compared to the proposed heuristic algorithm results, station paralleling results and optimal solutions without paralleling.

Subject Keywords

General Engineering.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Optimum design of pın-jointed 3-D dome structures using global optimization techniques Saraç, Yavuz; Hasançebi, Oğuzhan; Department of Civil Engineering (2005) Difficult gradient calculations, converging to a local optimum without exploring the design space adequately, too much dependency on the starting solution, lacking capabilities to treat discrete and mixed design variables are the main drawbacks of conventional optimization techniques. So evolutionary optimization methods received significant interest amongst researchers in the optimization area. Genetic algorithms (GAs) and simulated annealing (SA) are the main representatives of evolutionary optimization m...
Fast cell determination of the DSMC molecules in multi-stage turbo molecular pump design Sengil, N.; Edis, Fırat Oğuz (Elsevier BV, 2011-06-01) In this study, an existing 2D parallel DSMC solver is modified, to analyze the multi-stage turbomolecular pumps more efficiently. Generally, molecule movements are traced cell-by-cell in DSMC solvers both in structured and unstructured meshes in order to determine which cell the DSMC molecule is positioned in. These calculations require time consuming trigonometric operations. If a nonrectangular physical domain can be converted into a rectangular computational domain using curvilinear coordinates, then it ...
Mathematical modeling of horizontal two-phase flow through fully eccentric annuli Ömürlü, Çiğdem; Özbayoğlu, Evren; Department of Petroleum and Natural Gas Engineering (2006) The primary objective of this study is to understand the mechanism, the hydraulics and the characteristics, of the two-phase flow in horizontal annuli. While achieving this goal, both theoretical and experimental works have been conducted extensively. The METU-PETE-CTMFL (Middle East Technical University, Petroleum and Natural Gas Engineering Department, Cuttings Transport and Multiphase Flow Laboratory) multiphase flow loop consists of 4.84 m long eccentric horizontal acrylic pipes having 0.1143m inner dia...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
Beam search algorithm for capacity allocation problem in flexible manufacturing systems Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01) This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.

Citation Formats

Ö. Kaplan, “Assembly Line Balancing with Task Paralleling,” M.S. - Master of Science, Middle East Technical University, 2004.