Show simple item record

dc.contributor.authorCalleja Sanz, Gema
dc.contributor.authorCorominas Subias, Albert
dc.contributor.authorGarcía Villoria, Alberto
dc.contributor.authorPastor Moreno, Rafael
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2014-07-14T10:50:56Z
dc.date.created2014-08-01
dc.date.issued2014-08-01
dc.identifier.citationCalleja, G. [et al.]. Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2). "Computers & operations research", 01 Agost 2014, vol. 48, p. 113-123.
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/2117/23492
dc.description.abstractWe propose an approach combining a matheuristic and a MILP model to solve the variant Level 2 of the Accessibility Windows Assembly Line Balancing Problem (AWALBP-L2). This is a novel problem that arises in those real-world assembly lines where, in contrast to the most common ones, the length of the workpieces is larger than the widths of the workstations. This means that, at any time, a workstation cannot access an entire workpiece, but only a restricted portion of a workpiece or two consecutive workpieces. As a result, a workstation can only perform, at any time, the subset of tasks that fall inside its accessible area. The problem is to solve the task assignment and the movement scheme subproblems, while minimizing the cycle time. The proposed solving approach consists of (i) a matheuristic to generate good feasible solutions and compute bounds and (ii) a MILP model that makes use of the obtained bounds. A computational study is carried out to compare the performance of the proposed approach with the existing literature. (C) 2014 Elsevier Ltd. All rights reserved.
dc.format.extent11 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshAssembly-line balancing
dc.subject.lcshHeuristic algorithms
dc.subject.otherAssembly line balancing
dc.subject.otherAccessibility windows
dc.subject.otherMODEL
dc.titleCombining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
dc.typeArticle
dc.subject.lemacTreball en cadena
dc.subject.lemacProgramació heurística
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.identifier.doi10.1016/j.cor.2014.03.009
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0305054814000641
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac14906395
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorCalleja, G.; Corominas, A.; García-Villoria, A.; Pastor, R.
local.citation.publicationNameComputers & operations research
local.citation.volume48
local.citation.startingPage113
local.citation.endingPage123


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain