DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, HC | - |
dc.contributor.author | Chang, SY | - |
dc.date.accessioned | 2016-04-01T02:15:29Z | - |
dc.date.available | 2016-04-01T02:15:29Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2005-02 | - |
dc.identifier.issn | 1382-6905 | - |
dc.identifier.other | 2005-OAK-0000004886 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/24769 | - |
dc.description.abstract | We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch with a fixed capacity. The problem can be modelled by a graph G = (V,E), where each node v is an element of V corresponds to an order, its weight w(v) corresponds to the amount of ordered quantity and a pair of orders, say u and v may be grouped in a batch if there exists the edge (u,v) is an element of E. The objective is to maximize the number of batches filled up to its capacity lambda . In this paper, we prove that the problem is NP-hard and, moreover, that no PTAS exists unless P = NP. Then, an optimal algorithm is developed with running time O(|V|log |V|) for the special case when G is a tree. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.subject | batch processing | - |
dc.subject | three dimensional matching | - |
dc.subject | tree | - |
dc.subject | SYSTEMS | - |
dc.title | Order consolidation for batch processing | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1007/S10878-005-5488-Z | - |
dc.author.google | Hwang, HC | - |
dc.author.google | Chang, SY | - |
dc.relation.volume | 9 | - |
dc.relation.issue | 1 | - |
dc.relation.startpage | 121 | - |
dc.relation.lastpage | 138 | - |
dc.contributor.id | 10109240 | - |
dc.relation.journal | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL OPTIMIZATION, v.9, no.1, pp.121 - 138 | - |
dc.identifier.wosid | 000227159000009 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 138 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 121 | - |
dc.citation.title | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.citation.volume | 9 | - |
dc.contributor.affiliatedAuthor | Chang, SY | - |
dc.identifier.scopusid | 2-s2.0-17444373163 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 8 | - |
dc.description.scptc | 9 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | batch processing | - |
dc.subject.keywordAuthor | three dimensional matching | - |
dc.subject.keywordAuthor | tree | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.