Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)

García‐Villoria, Alberto; Corominas, Albert; Pastor, Rafael

doi:10.1016/j.cor.2015.04.001

Cited by 10 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, in García-Villoria et al (Battaïa and Dolgui, 2013). In particular, SA has been used to solve AWALBP (Calleja et al, 2016;García-Villoria et al, 2015).…”

Section: Matheuristic Proceduresmentioning

confidence: 99%

“…AWALBP-L1-1 is solved heuristically in Müller-Hannemann and Weihe ( 2006) and optimally with mixed integer linear programming (MILP) in Calleja et al (2014). García-Villoria et al (2015) propose heuristics and simulated annealing procedures for AWALBP-L1-M considering that the processing times of the tasks depend on the workstations. Two MILP models are proposed in Calleja et al (2013) and metaheuristics and matheuristics procedures in Calleja et al (2014Calleja et al ( , 2016 to solve AWALBP-L2-1.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints

García‐Villoria

Corominas

Nadal³

et al. 2018

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

Assembly line balancing problems (ALBPs) are among the most studied combinatorial optimization problems due to their relevance in many production systems. In particular, the accessibility windows ALBP (AWALBP) may arise when the workpieces are larger than the workstations, which implies that at a given instant the workstations have access to only a portion of the workpieces. Thus, the cycle is split into forward steps and stationary stages. The workpieces advance during the forward steps and the tasks are processed during the stationary stages. Several studies have dealt with the AWALBP assuming that there are no precedence relationships between tasks. However, this assumption is not always appropriate. In this work we solve the first level of AWALBP (AWALBP-L1) considering the existence of precedence relationships. Specifically, this work deals with variant 1 (AWALBP-L1-1), in which each task can be performed at only one workstation and, therefore, only the stationary stages and the starting instants in which the tasks are performed have to be decided. We design a solution procedure that includes pre-processing procedures, a matheuristic and a mixed integer linear programming model. An extensive computational experiment is carried out to evaluate its performance.

show abstract

“…For instance, in García-Villoria et al (Battaïa and Dolgui, 2013). In particular, SA has been used to solve AWALBP (Calleja et al, 2016;García-Villoria et al, 2015).…”

Section: Matheuristic Proceduresmentioning

confidence: 99%