Browsing by Subject "Assembly line balancing"

Now showing 1 - 4 of 4

Open Access
A goal programming approach to mixed-model assembly line balancing problem
(Elsevier, 1997) Gokcen, H.; Erel, E.
In this paper, a binary goal programming model for the mixed-model assembly line balancing (ALB) problem is developed. The model is based on the concepts developed by Patterson and Albracht [1] and the model of Deckro and Rangachari [2] developed for the single-model ALB problem. The proposed model provides a considerable amount of flexibility to the decision maker since several conflicting goals can be simultaneously considered.
Open Access
Shortest-route formulation of mixed-model assembly line balancing problem
(Elsevier, 1999) Erel, E.; Gokcen, H.
A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on an algorithm which solves the single-model version of the problem. The mixed-model system is transformed into a single-model system with a combined precedence diagram. The model is capable of considering any constraint that can be expressed as a function of task assignments.
Open Access
Stochastic assembly line balancing using beam search
(Taylor & Francis, 2005) Erel, E.; Sabuncuoglu, I.; Sekerci, H.
This paper presents a beam search-based method for the stochastic assembly line balancing problem in U-lines. The proposed method minimizes total expected cost comprised of total labour cost and total expected incompletion cost. A beam search is an approximate branch and bound method that operates on a search tree. Even though beam search has been used in various problem domains, this is the first application to the assembly line balancing problem. The performance of the proposed method is measured on various test problems. The results of the computational experiments indicate that the average performance of the proposed method is better than the best-known heuristic in the literature for the traditional straight-line problem. Since the proposed method is the first heuristic for the stochastic U-type problem with the total expected cost criterion, we only report its results on the benchmark problems. Future research directions and the related bibliography are also provided in the paper.
Open Access
Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph
(Taylor & Francis, 2009) Koc, A.; Sabuncuoglu, I.; Erel, E.
In this paper, the disassembly line balancing problem, which involves determining a line design in which used products are completely disassembled to obtain useable components in a cost-effective manner, is studied. Because of the growing demand for a cleaner environment, this problem has become an important issue in reverse manufacturing. In this study, two exact formulations are developed that utilize an AND/OR Graph (AOG) as the main input to ensure the feasibility of the precedence relations among the tasks. It is also shown that traditional task precedence diagrams can be derived from the AOG of a given product structure. This procedure leads to considerably better solutions of the traditional assembly line balancing problems; it may alter the approach taken by previous researchers in this area.