Branch-and-bound algorithms for the multi-product assembly line balancing problem

Berger, I.; Bourjolly, Jean-Marie; Laporte, Gilbert

doi:10.1016/0377-2217(92)90208-q

Cited by 53 publications

(38 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multi-model lines are used rarely since they require setup times between passes from one model to another. They have been studied by few researchers such as Berger et al (1992) Pastor et al (2002) Eryuruk et al (2008. Table 2 gives a summary of the main contributions in the literature on mixed-model assembly line balancing problem from 2007 to 2013.…”

Section: International Journal Of Production Researchmentioning

confidence: 99%

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Küçükkoç

Zhang

2014

International Journal of Production Research

View full text Add to dashboard Cite

Growing interests from customers in customised products and increasing competitions among peers necessitate companies to configure their manufacturing systems more effectively than ever before. We propose a new assembly line system configuration for companies that need intelligent solutions to satisfy customised demands on time with existing resources. A mixed-model parallel two-sided assembly line system is introduced based on the parallel two-sided assembly line system previously proposed by Ozcan et al. (Balancing parallel two-sided assembly lines, International Journal of Production Research, 48 (16), 4767-4784, 2010). The mixed-model parallel two-sided assembly line balancing problem is illustrated with examples from the perspective of simultaneous balancing and sequencing. An agent based ant colony optimisation algorithm is proposed to solve the problem. This algorithm is the first attempt in the literature to solve an assembly line balancing problem with an agent based ant colony optimisation approach. The algorithm is illustrated with an example and its operational procedures and principles explained and discussed.Keywords: mixed-model parallel two-sided assembly lines; assembly line balancing; agent based ant colony optimisation; meta-heuristics; artificial intelligence

show abstract

Section: International Journal Of Production Researchmentioning

confidence: 99%

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Küçükkoç

Zhang

2014

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Sarin and Erel (1990) developed a cost model for the single-model stochastic assembly line balancing problem for minimizing the total labor cost. Berger et al (1992) adopted Branch-and-Bound algorithm for the multi-product assembly line balancing problem. Suresh and Sahu (1994) addressed simulated annealing for assembly line balancing problem.…”

Section: Introductionmentioning

confidence: 99%

A new type of problem to stabilize an assembly setup

Roy¹,

Khan²

2011

msl

View full text Add to dashboard Cite

Traditional assembly lines are still attractive means of mass and large-scale series production. Previous research works mainly dealt with the minimization of balancing loss, subject to precedence constraints. Very recently the focus of attention shifted towards system loss. However, these losses are not the proper indicators of the stability of the system since the efficiency of the assembly line increases normally when the stability of the system increases. In this paper, we introduce a new type of assembly line, which is totally different form the existing types of assembly line studied in the literature. In this work, we define the stability of the system in terms of reliability of the assembly line. The objective is to design an assembly line with a desired level of working stability measured through this reliability measure. This special type of assembly line, where production rate can be increased by minimizing the cycle time subject to a given level of reliability and precedence constraints, extends the decision-making framework available in the literature on assembly line balancing problem and indirectly takes care of both balancing loss and system loss.

show abstract

“…The Vehicle Routing Problem on Trees (TVRP) is defined on a tree T ϭ (V, E), where V ϭ {v 1 , v 2 , . .…”

Section: Introductionmentioning

confidence: 99%

Two exact algorithms for the vehicle routing problem on trees

Mbaraga

Laporte

1999

Naval Research Logistics

Self Cite

View full text Add to dashboard Cite

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999

show abstract

Branch-and-bound algorithms for the multi-product assembly line balancing problem

Cited by 53 publications

References 10 publications

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

A new type of problem to stabilize an assembly setup

Two exact algorithms for the vehicle routing problem on trees

Contact Info

Product

Resources

About