Uniform Parallel Machine Scheduling with Sequence Dependent Setup Times: A Randomized Heuristic
| dc.contributor.author | Beste Yıldız | |
| dc.contributor.author | Levent Kandiller | |
| dc.contributor.author | Ayhan Özgür Toy | |
| dc.contributor.editor | N.M. Durakbasa , M.G. Gençyılmaz | |
| dc.date.accessioned | 2025-10-06T17:50:19Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We consider the uniform parallel machine scheduling problem with sequence-dependent setup times to minimize the total completion times. This problem is known to be NP-hard. We propose a simple randomized heuristic with an improvement subroutine. We analyze the performance of the proposed heuristic through a computational study. Our computational study indicates that the heuristic performs well in terms of optimality gap and solution time. © 2022 Elsevier B.V. All rights reserved. | |
| dc.identifier.doi | 10.1007/978-3-030-90421-0_69 | |
| dc.identifier.isbn | 9789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 9789819748051 | |
| dc.identifier.issn | 21954364, 21954356 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119858187&doi=10.1007%2F978-3-030-90421-0_69&partnerID=40&md5=1a5c6cc0489dc7fe944f1c656537df31 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/8856 | |
| dc.language.iso | English | |
| dc.publisher | Springer Science and Business Media Deutschland GmbH | |
| dc.relation.ispartof | International Symposium for Production Research ISPR2021 | |
| dc.source | Lecture Notes in Mechanical Engineering | |
| dc.subject | Full Factorial Design, Parallel Machine Scheduling, Randomized Heuristic, Sequence-dependent Setup Time, Total Completion Times, Uniform Machines, Machinery, Computational Studies, Full Factorial Design, Np-hard, Parallel Machine-scheduling Problems, Parallel Machines Scheduling, Randomized Heuristics, Sequence-dependent Setup Time, Total Completion Time, Uniform Machine, Uniform Parallel Machine Scheduling, Scheduling | |
| dc.subject | Machinery, Computational studies, Full factorial design, NP-hard, Parallel machine-scheduling problems, Parallel machines scheduling, Randomized heuristics, Sequence-dependent setup time, Total completion time, Uniform machine, Uniform parallel machine scheduling, Scheduling | |
| dc.title | Uniform Parallel Machine Scheduling with Sequence Dependent Setup Times: A Randomized Heuristic | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.identifier.openalex | W3212986656 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.3811355E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 1.4634384E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 1.2555 | |
| gdc.openalex.normalizedpercentile | 0.81 | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.mendeley | 1 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.virtual.author | Toy, Ayhan Özgür | |
| oaire.citation.endPage | 825 | |
| oaire.citation.startPage | 812 | |
| person.identifier.scopus-author-id | Yıldız- Beste (57212210592), Kandiller- Levent (6506822666), Toy- Ayhan Özgür (14521673500) | |
| relation.isAuthorOfPublication | 40d5f673-8a20-4e1f-b0a3-777528129295 | |
| relation.isAuthorOfPublication.latestForDiscovery | 40d5f673-8a20-4e1f-b0a3-777528129295 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |