Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1713027 | Journal of Systems Engineering and Electronics | 2008 | 8 Pages |
Abstract
A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Li Kai, Yang Shanlin,