Publication: A constant-factor approximation algorithm for multi-vehicle collection for processing problem
dc.contributor.coauthor | Gel, Esma S. | |
dc.contributor.department | Department of Industrial Engineering | |
dc.contributor.department | Graduate School of Sciences and Engineering | |
dc.contributor.kuauthor | Örmeci, Lerzan | |
dc.contributor.kuauthor | Salman, Fatma Sibel | |
dc.contributor.kuauthor | Yücel, Eda | |
dc.contributor.schoolcollegeinstitute | College of Engineering | |
dc.contributor.schoolcollegeinstitute | GRADUATE SCHOOL OF SCIENCES AND ENGINEERING | |
dc.date.accessioned | 2024-11-09T23:20:17Z | |
dc.date.issued | 2013 | |
dc.description.abstract | We define the multiple-vehicle collection for processing problem (mCfPP) as a vehicle routing and scheduling problem in which items that accumulate at customer sites over time should be transferred by a series of tours to a processing facility. We show that this problem with the makespan objective (mCfPP()) is NP-hard using an approximation preserving reduction from a two-stage, hybrid flowshop scheduling problem. We develop a polynomial-time, constant-factor approximation algorithm to solve mCfPP(). The problem with a single site is analyzed as a special case with two purposes. First, we identify the minimum number of vehicles required to achieve a lower bound on the makespan, and second, we characterize the optimal makespan when a single vehicle is utilized. | |
dc.description.indexedby | WOS | |
dc.description.indexedby | Scopus | |
dc.description.issue | 7 | |
dc.description.openaccess | NO | |
dc.description.sponsoredbyTubitakEu | N/A | |
dc.description.volume | 7 | |
dc.identifier.doi | 10.1007/s11590-012-0578-1 | |
dc.identifier.issn | 1862-4472 | |
dc.identifier.scopus | 2-s2.0-84884669819 | |
dc.identifier.uri | https://doi.org/10.1007/s11590-012-0578-1 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14288/10677 | |
dc.identifier.wos | 324824600017 | |
dc.keywords | Approximation algorithm | |
dc.keywords | Vehicle routing and scheduling | |
dc.keywords | Makespan | |
dc.language.iso | eng | |
dc.publisher | Springer Heidelberg | |
dc.relation.ispartof | Optimization Letters | |
dc.subject | Operations research | |
dc.subject | Management science | |
dc.subject | Mathematics | |
dc.title | A constant-factor approximation algorithm for multi-vehicle collection for processing problem | |
dc.type | Journal Article | |
dspace.entity.type | Publication | |
local.contributor.kuauthor | Yücel, Eda | |
local.contributor.kuauthor | Salman, Fatma Sibel | |
local.contributor.kuauthor | Örmeci, Lerzan | |
local.publication.orgunit1 | GRADUATE SCHOOL OF SCIENCES AND ENGINEERING | |
local.publication.orgunit1 | College of Engineering | |
local.publication.orgunit2 | Department of Industrial Engineering | |
local.publication.orgunit2 | Graduate School of Sciences and Engineering | |
relation.isOrgUnitOfPublication | d6d00f52-d22d-4653-99e7-863efcd47b4a | |
relation.isOrgUnitOfPublication | 3fc31c89-e803-4eb1-af6b-6258bc42c3d8 | |
relation.isOrgUnitOfPublication.latestForDiscovery | d6d00f52-d22d-4653-99e7-863efcd47b4a | |
relation.isParentOrgUnitOfPublication | 8e756b23-2d4a-4ce8-b1b3-62c794a8c164 | |
relation.isParentOrgUnitOfPublication | 434c9663-2b11-4e66-9399-c863e2ebae43 | |
relation.isParentOrgUnitOfPublication.latestForDiscovery | 8e756b23-2d4a-4ce8-b1b3-62c794a8c164 |