Multi criteria assembly line balancing problem with equipment decisions

Download
2006
Pekin, Nilüfer
In this thesis, we develop an exact algorithm for an assembly line balancing problem with equipment selection decisions. Two objectives are considered: minimizing the total equipment costs and the number of workstations. Our aim is to choose the type of the equipment(s) in every workstation and determine the assignment of the tasks to each workstation and equipment type. We aim to propose a set of efficient solutions for each problem and leave the choice of the best solution to the decision maker̕s preferences. A branch and bound algorithm is developed whose efficiency is increased with some dominance rules and powerful lower bounds. Moreover, modified ranked positional weight heuristic method is used as initial upper bound. The effectiveness of the proposed procedure is demonstrated by computational analysis in which the effects of changing certain parameter values are investigated. We find that our algorithm is capable of solving the problem instances with up to 25 tasks and 5 equipments.

Suggestions

Profit oriented disassembly line balancing
Altekin, Fatma Tevhide; Kandiller, Levent; Department of Industrial Engineering (2005)
In this study, we deal with the profit oriented partial disassembly line balancing problem which seeks a feasible assignment of selected disassembly tasks to stations such that the precedence relations among the tasks are satisfied and the profit is maximized. We consider two versions of this problem. In the profit maximization per cycle problem (PC), we maximize the profit for a single disassembly cycle given the task times and costs, part revenues and demands and station costs. We propose a heuristic solu...
Optimal Policy Synthesis from A Sequence of Goal Sets with An Application to Electric Distribution System Restoration
Isik, Ilker; Arpalı, Onur Yigit; Aydın Göl, Ebru (2021-01-01)
Motivated by the post-disaster distribution system restoration problem, in this paper, we study the problem of synthesizing the optimal policy for a Markov Decision Process (MDP) from a sequence of goal sets. For each goal set, our aim is to both maximize the probability to reach and minimize the expected time to reach the goal set. The order of the goal sets represents their priority. In particular, our aim is to generate a policy that is optimal with respect to the first goal set, and it is optimal with r...
Nonlinear Seismic Dam and Foundation Analysis Using Explicit Newmark Integration Method with Static Condensation
Albostan, Utku; Bahcecioglu, Tunc; Arıcı, Yalın; Kurç, Özgür (Elsevier BV; 2017-09-13)
Engineers use the explicit Newmark integration method to analyze nonlinear dynamic problems. Instead of using computationally expensive global matrix assembly and factorization, the explicit integration method performs computations at element level which is computationally efficient, easily parallelizable, and does not require equilibrium iterations in case of nonlinear analysis. On the other hand, the explicit schema might require much smaller time steps compared to implicit integration alternative especia...
Analysis and network representation of hotspots in protein interfaces using minimum cut trees
Tunçbağ, Nurcan; Keskin, Ozlem; GÜRSOY, Attila (2010-08-01)
We propose a novel approach to analyze and visualize residue contact networks of protein interfaces by graph-based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge-based potentials. The mincut tree, which is constructed from the weighted residue network, simplifies and summarizes the complex structure of the contact network by an efficient and informative representation. This representation offers a comprehensible vie...
Improvement of Transform-Skip Mode in Lossy Intra Coding with 3-Tap Filters
Alvar, Saeed Ranjbar; Kamışlı, Fatih (2016-08-05)
Using transforms in video coding is an effective method in reducing the spatial redundancy. However, for some cases applying transforms does not reduce the spatial redundancy. For these cases, transforms are skipped and the prediction error is directly quantized and then entropy coded. To further reduce the spatial redundancy in the transform skipped blocks, a pixel-by-pixel lossy intra prediction method based on a two dimensional correlation model is proposed in this paper. In the proposed method, three re...
Citation Formats
N. Pekin, “Multi criteria assembly line balancing problem with equipment decisions,” M.S. - Master of Science, Middle East Technical University, 2006.