Article
Cited 3 time in 
Cited 4 time in 
Cited 4 time in
Metadata Downloads
A Note on “An Approximation Algorithm for the Load-balanced Semi-matching Problem in Weighted Bipartite Graphs” SCIE SCOPUS
- Title
- A Note on “An Approximation Algorithm for the Load-balanced Semi-matching Problem in Weighted Bipartite Graphs”
- Authors
- Lee, K; Leung, JYT; Pinedo, ML
- Date Issued
- 2009-05-31
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- We point out an error in the algorithm for the Load Balanced Semi-Matching Problem presented by C.P. Low [C.P. Low, An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs, Information Processing Letters 100 (2006) 154-161]. This problem is equivalent to a parallel machine scheduling problem subject to eligibility constraints, in which each job has a pre-determined set of machines capable of processing the job. (c) 2009 Elsevier B.V. All rights reserved.
- ISSN
- 0020-0190
- Article Type
- Article
- Citation
- INFORMATION PROCESSING LETTERS, vol. 109, no. 12, page. 608 - 610, 2009-05-31
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 이강복LEE, KANGBOK
- Dept. of Industrial & Management Eng.