A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs” |
| |
| Authors: | Kangbok Lee Joseph Y-T Leung Michael L Pinedo |
| |
| Affiliation: | a Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA
b Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA |
| |
| 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. |
| |
| Keywords: | Semi-matching Parallel machines scheduling Eligibility constraints Approximation algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
