A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs"

Authors

Kangbok Lee, Leonard N. Stern School of Business
Joseph Y.T. Leung, Department of Computer Science
Michael L. Pinedo, Leonard N. Stern School of Business

Document Type

Article

Publication Date

5-31-2009

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. © 2009 Elsevier B.V. All rights reserved.

Identifier

62749100498 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2009.02.010

ISSN

00200190

First Page

608

Last Page

610

Issue

12

Volume

109

Grant

KRF-2007-357-D00270

Fund Ref

National Science Foundation

Recommended Citation

Lee, Kangbok; Leung, Joseph Y.T.; and Pinedo, Michael L., "A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs"" (2009). Faculty Publications. 12073.
https://digitalcommons.njit.edu/fac_pubs/12073