To access the full text documents, please follow this link: http://hdl.handle.net/2117/122134
dc.contributor | Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. SCOM - Supply Chain and Operations Management |
dc.contributor.author | García Villoria, Alberto |
dc.contributor.author | Corominas Subias, Albert |
dc.contributor.author | Nadal Solà, Adrià |
dc.contributor.author | Pastor Moreno, Rafael |
dc.date | 2018-01-01 |
dc.identifier.citation | García-Villoria, A., Corominas, A., Nadal, A., Pastor, R. Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints. "European journal of operational research", 1 Gener 2018, vol. 271, núm. 3, p. 882-895. |
dc.identifier.citation | 0377-2217 |
dc.identifier.citation | 10.1016/j.ejor.2018.05.048 |
dc.identifier.uri | http://hdl.handle.net/2117/122134 |
dc.description.abstract | 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. |
dc.description.abstract | Peer Reviewed |
dc.language.iso | eng |
dc.publisher | Elsevier |
dc.relation | https://www.sciencedirect.com/science/article/abs/pii/S0377221718304594 |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Economia i organització d'empreses |
dc.subject | Heuristic algorithms |
dc.subject | Assembly-line balancing |
dc.subject | Manufacturing |
dc.subject | Assembly line balancing |
dc.subject | Accessibility windows |
dc.subject | Matheuristic procedure |
dc.subject | Programació heurística |
dc.subject | Treball en cadena |
dc.title | Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |