A heuristic procedure for solving the Lexicographic Bottleneck Assembly Line Balancing Problem (LB-ALBP)

Pastor, Rafael; Chueca, Ignacio; García‐Villoria, Alberto

doi:10.1080/00207543.2011.578164

Cited by 15 publications

(14 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The difference is that instead of using the unmodified index value, the constructions are done applying the greedy function ( , ) to choose the tasks and assign them to the workstations. Since in the first iteration the memory structures are empty, ( , ) = ( ) and the construction is identical to the original procedure suggested by Pastor et al (2012).…”

Section: Tabu Searchmentioning

confidence: 99%

“…Our improvement method is the local search in (Pastor et al 2012), which is the best among those published in the literature for LB-ALBP. is a hill climbing procedure that employs trade and transfer of tasks between pairs of workstations (Moodie and Young, 1965).…”

Section: [Insert Figure 4 Here]mentioning

confidence: 99%

“…In the example above, with = 100 (the typical value employed in the literature, see Pastor (2011) and Pastor et al (2012)), the ideal distribution of workloads is = (10,8,8,7,7), and the ordered workloads for the first design are 10, 10, 9, 6, and 5. Therefore, value for the first design is:…”

Section: [Insert Figure 2 Here]mentioning

confidence: 99%

“…Our experiments to compare existing procedures with our proposed procedures are performed on the same 301 problem instances used in (Pastor et al 2012).…”

Section: Computational Experimentsmentioning

confidence: 99%

“…The heuristics consisted of several strategies to use a limited computational budget. Pastor et al (2012) proposed V-LSPa, a deterministic heuristic based on iteratively solving SALBP-2. VLSPa sequentially solves and divides the problem into two smaller subproblems (with lower number of workstations and tasks to assign) using the most heavily loaded workstation in each subproblem as the split point.…”

Section: − +1 =1mentioning

confidence: 99%

See 4 more Smart Citations

Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem

Pastor

García‐Villoria

Laguna

et al. 2015

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem -recently introduced to the literature (Pastor 2011)-has practical relevance to manufacturing facilities. We design, implement and fine-tune GRASP, tabu search and scatter search heuristics for the LB-ALBP and show that our procedures are able to obtain solutions of a quality that outperforms previous approaches. We rely on both semi-greedy and memory-based designs that our experiments show to be effective. Experimental results verify the advantages of embedding such designs to improve the solution existing in the literature of this complex problem. Additionally, the extensive experimentation with 48 variants of GRASP, 12 of tabu search and 1 of scatter search establishes the benefits of adding enhanced search strategies to basic procedures.

show abstract

Section: Tabu Searchmentioning

confidence: 99%

Section: [Insert Figure 4 Here]mentioning

confidence: 99%

Section: [Insert Figure 2 Here]mentioning

confidence: 99%

“…Our experiments to compare existing procedures with our proposed procedures are performed on the same 301 problem instances used in (Pastor et al 2012).…”

Section: Computational Experimentsmentioning

confidence: 99%

Section: − +1 =1mentioning

confidence: 99%

See 3 more Smart Citations