A disassembly line balancing problem with fixed number of workstations
| dc.contributor.author | Eda Göksoy Kalaycilar | |
| dc.contributor.author | Meral Azizoǧlu | |
| dc.contributor.author | Sencer Yeralan | |
| dc.contributor.author | Azizoglu, Meral | |
| dc.contributor.author | Kalaycilar, Eda Göksoy | |
| dc.contributor.author | Yeralan, Sencer | |
| dc.contributor.author | Azizoʇlu, Meral | |
| dc.date.accessioned | 2025-10-06T17:52:10Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In this study a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical however different parts can be released from different units of the product. There is a finite number of identical workstations that perform the necessary disassembly operations referred to as tasks. We present several upper and lower bounding procedures that assign the tasks to the workstations so as to maximize the total net revenue. The computational study has revealed that the procedures produce satisfactory results. © 2016 Elsevier B.V. All rights reserved. | |
| dc.identifier.doi | 10.1016/j.ejor.2015.09.004 | |
| dc.identifier.issn | 03772217 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.issn | 1872-6860 | |
| dc.identifier.scopus | 2-s2.0-84952984791 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84952984791&doi=10.1016%2Fj.ejor.2015.09.004&partnerID=40&md5=6aa5453bd4940a34b52c553d1ae1e273 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/9809 | |
| dc.identifier.uri | https://doi.org/10.1016/j.ejor.2015.09.004 | |
| dc.language.iso | English | |
| dc.publisher | Elsevier | |
| dc.relation.ispartof | European Journal of Operational Research | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.source | European Journal of Operational Research | |
| dc.subject | Disassembly Lines, Heuristics, Integer Programming, Linear Programming Relaxation, Linear Programming, Bounding Procedures, Computational Studies, Disassembly Line, Disassembly Line Balancing, Disassembly Operations, Finite Number, Heuristics, Linear Programming Relaxation, Integer Programming | |
| dc.subject | Linear programming, Bounding procedures, Computational studies, Disassembly line, Disassembly line balancing, Disassembly operations, Finite number, Heuristics, Linear programming relaxation, Integer programming | |
| dc.subject | Disassembly Lines | |
| dc.subject | Linear Programming Relaxation | |
| dc.subject | Heuristics | |
| dc.subject | Integer Programming | |
| dc.title | A disassembly line balancing problem with fixed number of workstations | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.author.id | Azizoglu, Meral/0000-0001-6327-3012 | |
| gdc.author.id | Yeralan, Sencer/0000-0002-8689-5268 | |
| gdc.author.scopusid | 7004040168 | |
| gdc.author.scopusid | 56938723900 | |
| gdc.author.scopusid | 7005373361 | |
| gdc.author.wosid | Azizoglu, Meral/AAZ-7992-2020 | |
| gdc.bip.impulseclass | C4 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | true | |
| gdc.description.department | ||
| gdc.description.departmenttemp | [Kalaycilar, Eda Goksoy] ASELSAN, Naval Syst Program Directorate, TR-06172 Ankara, Turkey; [Azizoglu, Meral] Middle E Tech Univ, Dept Ind Engn, TR-06800 Ankara, Turkey; [Yeralan, Sencer] Yasar Univ, Dept Ind Engn, Izmir, Turkey | |
| gdc.description.endpage | 604 | |
| gdc.description.issue | 2 | |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| gdc.description.startpage | 592 | |
| gdc.description.volume | 249 | |
| gdc.description.woscitationindex | Science Citation Index Expanded | |
| gdc.identifier.openalex | W2102143815 | |
| gdc.identifier.wos | WOS:000366951100019 | |
| gdc.index.type | Scopus | |
| gdc.index.type | WoS | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 17.0 | |
| gdc.oaire.influence | 4.7919047E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | disassembly lines | |
| gdc.oaire.keywords | Integer programming | |
| gdc.oaire.keywords | heuristics | |
| gdc.oaire.keywords | linear programming relaxation | |
| gdc.oaire.keywords | Production models | |
| gdc.oaire.keywords | Approximation methods and heuristics in mathematical programming | |
| gdc.oaire.keywords | integer programming | |
| gdc.oaire.popularity | 3.1235395E-8 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0209 industrial biotechnology | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 7.4769 | |
| gdc.openalex.normalizedpercentile | 0.97 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 59 | |
| gdc.plumx.crossrefcites | 9 | |
| gdc.plumx.mendeley | 53 | |
| gdc.plumx.scopuscites | 63 | |
| gdc.scopus.citedcount | 63 | |
| gdc.virtual.author | Yeralan, Sencer | |
| gdc.wos.citedcount | 56 | |
| oaire.citation.endPage | 604 | |
| oaire.citation.startPage | 592 | |
| person.identifier.scopus-author-id | Kalaycilar- Eda Göksoy (56938723900), Azizoǧlu- Meral (7005373361), Yeralan- Sencer (7004040168) | |
| publicationissue.issueNumber | 2 | |
| publicationvolume.volumeNumber | 249 | |
| relation.isAuthorOfPublication | 7587648d-186d-40d2-b36c-483e6ffde062 | |
| relation.isAuthorOfPublication.latestForDiscovery | 7587648d-186d-40d2-b36c-483e6ffde062 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |