Two-sided U-type assembly line balancing problem

Ağpak, Kürşad; Yegul, Mustafa Fatih; Gökçen, Hadi

doi:10.1080/00207543.2011.631599

Cited by 30 publications

(17 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Exact methods have also been presented by Wu et al (2008) and Hu et al (2010). Extensions include mixed-model lines (Özcan and Toklu 2009b), multiple objectives (Özcan and Toklu 2009c;Tapkan, Özbakır, and Baykasoğlu 2012), parallel lines (Özcan, Gökçen, and Toklu 2010) and U-shaped lines (Ağpak, Yegül, and Gökçen 2012;Rabbani, Moghaddam, and Manavizadeh 2012).…”

Section: Two-sided Line Balancingmentioning

confidence: 99%

Balancing stochastic two-sided assembly lines

Chiang

Urban

Luo³

2015

International Journal of Production Research

View full text Add to dashboard Cite

In a two-sided assembly line, tasks can be executed simultaneously on both sides of the line. One task cannot be started until both of its direct predecessors on the left and right sides are completed. Therefore, the start time of the task is the maximum of the two predecessors' finish times. In many realistic situations, it is assumed that the task times are independent and normally distributed with known means and variances. However, the maximum of two normal variables is not normally distributed, but can be well approximated by results from extreme value theory. In this paper, we utilise these results to develop a solution methodology to balance two-sided assembly lines with stochastic task times, minimising the line length and the number of stations while guaranteeing all tasks are completed within the cycle time with a given confidence level.

show abstract

Section: Two-sided Line Balancingmentioning

confidence: 99%

Balancing stochastic two-sided assembly lines

Chiang

Urban

Luo³

2015

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…The problem of optimally allocating tasks to stations is known as the U‐line balancing problem (UALBP). Urban () has proposed an integer linear program for solving the UALBP‐1, which is often used in studies of the UALBP (e.g., in Aase et al., ; Gökçen and Aǧpak, ; Chiang et al., ; Erin, ; Kara and Tekin, ; Aǧpak et al., ).…”

Section: Application To Related Problemsmentioning

confidence: 99%

“…The formulations for the SALBP have been tested on the standard benchmark that contains 269 instances of the SALBP‐1 and 302 instances of the SALBP‐2. All instances are available online (ALB Research Group, ). Currently the optimal value is known for the 269 SALBP‐1 instances and all except 14 of the SALBP‐2 instances.…”

Section: Computational Experimentsmentioning

confidence: 99%

“…These include assembly lines of different layout, for example, U‐shaped lines, lines with assignment restrictions, varying task times, or setup times. Becker and Scholl () survey generalized assembly line balancing problems, and the ALB Research Group () provides a property‐based search for information on these problems.…”

Section: Introductionmentioning

confidence: 99%

“…() can be improved by the formulations proposed in this paper. Urban's model is widely used in the literature as originally proposed (Aase et al., ; Gökçen and Aǧpak, ; Chiang et al., ; Erin, ; Kara and Tekin, ; Aǧpak et al., ), and a better model may improve the results in these applications. In the case of the BPP‐P, it turns out that the best integer model is competitive with a sophisticated tailored branch‐and‐bound algorithm, demonstrating its utility as a tool for obtaining a rapid, reasonable solution method for new problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved integer programming models for simple assembly line balancing and related problems

Ritt

Costa

2015

Int Trans Operational Res

View full text Add to dashboard Cite

We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer program theoretically dominates all previous formulations using impulse variables, and produces solutions of significantly better quality in practice. The improved formulation can be used to strengthen related problems with similar restrictions. We demonstrate their effectiveness on the U-shaped assembly line balancing problem and on the bin packing problem with precedence constraints.

show abstract

An Uncertain Programming Model for Two-Sided Assembly Line Balancing Under Uncertain Task Time

Li¹

2022

Engineering Applications of Computational Methods

View full text Add to dashboard Cite

Two-sided U-type assembly line balancing problem

Cited by 30 publications

References 34 publications

Balancing stochastic two-sided assembly lines

Balancing stochastic two-sided assembly lines

Improved integer programming models for simple assembly line balancing and related problems

An Uncertain Programming Model for Two-Sided Assembly Line Balancing Under Uncertain Task Time

Contact Info

Product

Resources

About