A MILP model for the Accessibility Windows Assembly Line Balancing Problem (AWALBP)

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

doi:10.1080/00207543.2012.751514

Cited by 13 publications

(22 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2). This environment, where task positioning limits the access to restricted areas of the workpiece, motivates the so-called accessibility windows assembly line balancing problem (AWALBP) (Calleja et al, 2013). A well-known classification of assembly line balancing problems is the one proposed by Baybars (1986), which differentiates between two classic problems: the Simple Assembly Line Balancing Problem (SALBP) and the General Assembly Line Balancing Problem (GALBP).…”

Section: Accepted Manuscriptmentioning

confidence: 99%

“…The optimization of AWALBP involves the solution of several NP-hard subproblems (Gaudlitz, 2004). With regard to the subproblems considered, the AWALBP can be tackled at four optimization levels (Calleja et al, 2013): the assignment of each task to one compatible workstation and stationary stage (AWALBP-L1); the initial position of the workpieces in the cycle, as well as the number and the length of the forward steps (AWALBP-L2); the component type allocation to feeders (AWALBP-L3); and the number and the type of workstations (AWALBP-L4). The objective is to minimize the cycle time.…”

Section: Accepted Manuscriptmentioning

confidence: 99%

“…For example, in AWALBP-L2 levels L1 and L2 are to be solved when solutions of L3 and L4 are given. A detailed description of AWALBP and its variants, along with a literature review has been presented in Calleja et al (2013). Tazari et al (2006) studied a variant of the problem that matches an AWALBP-L1, where for each task a subset of the workstations is compatible (instead of a single workstation).…”

Section: Accepted Manuscriptmentioning

confidence: 99%

“…Corominas and Pastor (2009) formulated the optimization problem as a mixedinteger linear programming (MILP) model, but they do not include computational results. Based on such formulation, two enhanced MILP models were proposed by Calleja et al (2013). In order to allow further research, a set of realistic benchmark instances was generated and uploaded online (https://www.ioc.upc.edu/EOLI/research/),…”

Section: Accepted Manuscriptmentioning

confidence: 99%

“…What emerges from the computational results on AWALBP-L2 (Calleja et al, 2013(Calleja et al, , 2014 is that computing an optimal solution of the problem might become intractable for large size instances. This may be expected since even the simplest version of the problem, AWALBP-L1, is already NP-hard, as proven in Calleja et al (2014).…”

Section: Accepted Manuscriptmentioning

confidence: 99%

See 4 more Smart Citations

Hybrid metaheuristics for the Accessibility Windows Assembly Line Balancing Problem Level 2 (AWALBP-L2)

Calleja

Corominas

García‐Villoria

et al. 2016

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights  An assembly line with workpieces larger than the width of the stations is tackled.  Only restricted portions of the workpieces can be accessed from any workstation.  Three hybrids of metaheuristics and mathematical programming are proposed.  A novel procedure hybridizing tabu search and corridor method is provided.

show abstract

Section: Accepted Manuscriptmentioning

confidence: 99%

Section: Accepted Manuscriptmentioning

confidence: 99%