A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines
| dc.contributor.author | Demir L. | |
| dc.contributor.author | Diamantidis A. | |
| dc.contributor.author | Eliiyi Türsel, Deniz | |
| dc.contributor.author | O'Kelly M.E.J. | |
| dc.contributor.author | Papadopoulos C.T. | |
| dc.contributor.author | Tsadiras A.K. | |
| dc.contributor.author | Tunali S. | |
| dc.date.accessioned | 2023-06-16T15:03:10Z | |
| dc.date.available | 2023-06-16T15:03:10Z | |
| dc.date.issued | 2013 | |
| dc.description | et al.;for Management and Control;IFAC Technical Committee 3.2 on Computational;Intelligence in Control;International Federation of Automatic Control (IFAC) -;Technical Committee 5.2 - Manufacturing Modelling | en_US |
| dc.description | 7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 -- 19 June 2013 through 21 June 2013 -- Saint Petersburg -- 99324 | en_US |
| dc.description.abstract | This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu Search and Degraded Ceiling to solve the buffer allocation problem in reliable production lines. DECO algorithm is used to calculate throughput. This algorithm is a variant of a decomposition algorithm specifically developed to solve large reliable production lines with parallel machines at each workstation and exponentially distributed service times. The measures of performance used are the CPU time required and closeness to the maximum throughput achieved. The three search algorithms are ranked in respect to these two measures and certain findings regarding their performances over the experimental set are given. © IFAC. | en_US |
| dc.description.sponsorship | College of Environmental Science and Forestry, State University of New York, ESF; European Commission, EC; European Social Fund, ESF | en_US |
| dc.description.sponsorship | The research of A. Diamantidis, C.T. Papadopoulos and A.K. Tsadiras has been co-financed by the European Union (European Social Fund – ESF) and Greek national funds through the Operational Program "Education and Lifelong Learning" of the National Strategic Reference Framework (NSRF) - Research Funding Program: Thales. Investing in knowledge society through the European Social Fund. | en_US |
| dc.identifier.doi | 10.3182/20130619-3-RU-3018.00345 | |
| dc.identifier.isbn | 9.78E+12 | |
| dc.identifier.issn | 1474-6670 | |
| dc.identifier.scopus | 2-s2.0-84884336460 | |
| dc.identifier.uri | https://doi.org/10.3182/20130619-3-RU-3018.00345 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/3757 | |
| dc.language.iso | en | en_US |
| dc.publisher | IFAC Secretariat | en_US |
| dc.relation.ispartof | IFAC Proceedings Volumes (IFAC-PapersOnline) | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Buffer storage | en_US |
| dc.subject | Design | en_US |
| dc.subject | Optimization problems | en_US |
| dc.subject | Production lines | en_US |
| dc.subject | Search methods | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Design | en_US |
| dc.subject | Learning algorithms | en_US |
| dc.subject | Manufacture | en_US |
| dc.subject | Tabu search | en_US |
| dc.subject | Adaptive tabu search | en_US |
| dc.subject | Decomposition algorithm | en_US |
| dc.subject | Distributed service | en_US |
| dc.subject | Maximum through-put | en_US |
| dc.subject | Measures of performance | en_US |
| dc.subject | Optimization problems | en_US |
| dc.subject | Production line | en_US |
| dc.subject | Search method | en_US |
| dc.subject | Buffer storage | en_US |
| dc.title | A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 36809216100 | |
| gdc.author.scopusid | 14521079300 | |
| gdc.author.scopusid | 36923588900 | |
| gdc.author.scopusid | 7003379290 | |
| gdc.author.scopusid | 6603101230 | |
| gdc.author.scopusid | 7004191746 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.departmenttemp | Demir, L., Department of Industrial Engineering, Pamukkale University, Kinikli Campus, Denizli 20070, Turkey; Diamantidis, A., Department of Economics, Aristotle University of Thessaloniki, Greece; Eliiyi, D.T., Department of Industrial Systems Engineering, Izmir University of Economics, Sakarya Cad. No: 156, Balcova-Izmir, Turkey; O'Kelly, M.E.J., Waterford Institute of Technology, Waterford, Ireland; Papadopoulos, C.T., Department of Economics, Aristotle University of Thessaloniki, Greece; Tsadiras, A.K., Department of Economics, Aristotle University of Thessaloniki, Greece; Tunali, S., Department of Business Administration, Izmir University of Economics, Sakarya Cad. No: 156, Balcova-Izmir, Turkey | en_US |
| gdc.description.endpage | 1631 | en_US |
| gdc.description.issue | 9 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 1626 | en_US |
| gdc.description.volume | 46 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2084541253 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.5744615E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.keywords | Design | |
| gdc.oaire.keywords | Search methods | |
| gdc.oaire.keywords | Production lines | |
| gdc.oaire.keywords | Adaptive tabu search | |
| gdc.oaire.keywords | Manufacture | |
| gdc.oaire.keywords | Learning algorithms | |
| gdc.oaire.keywords | Distributed service | |
| gdc.oaire.keywords | Tabu search | |
| gdc.oaire.keywords | Production line | |
| gdc.oaire.keywords | Buffer storage | |
| gdc.oaire.keywords | Decomposition algorithm | |
| gdc.oaire.keywords | Measures of performance | |
| gdc.oaire.keywords | Search method | |
| gdc.oaire.keywords | Algorithms | |
| gdc.oaire.keywords | Optimization problems | |
| gdc.oaire.keywords | Maximum through-put | |
| gdc.oaire.popularity | 1.4293914E-9 | |
| gdc.oaire.publicfunded | true | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.21 | |
| gdc.opencitations.count | 1 | |
| gdc.plumx.crossrefcites | 1 | |
| gdc.plumx.mendeley | 12 | |
| gdc.plumx.scopuscites | 4 | |
| gdc.scopus.citedcount | 4 | |
| gdc.virtual.author | Tunalı, Semra | |
| gdc.virtual.author | Eliiyi Türsel, Deniz | |
| relation.isAuthorOfPublication | e53c0447-6e83-45f5-91d8-87bff8b0ed82 | |
| relation.isAuthorOfPublication | d3353425-ba83-4c30-a6f9-ae1d72bcfb0b | |
| relation.isAuthorOfPublication.latestForDiscovery | e53c0447-6e83-45f5-91d8-87bff8b0ed82 | |
| relation.isOrgUnitOfPublication | bdb88a44-c66f-45fd-b2ec-de89cb1c93a0 | |
| relation.isOrgUnitOfPublication | 7946402e-adc8-4c62-ac59-fbb13820ac91 | |
| relation.isOrgUnitOfPublication | 26a7372c-1a5e-42d9-90b6-a3f7d14cad44 | |
| relation.isOrgUnitOfPublication | d61c5ef4-1ebc-4355-bc4f-dfa76978271b | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | bdb88a44-c66f-45fd-b2ec-de89cb1c93a0 |
Files
Original bundle
1 - 1 of 1