Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1705892 | Applied Mathematical Modelling | 2009 | 14 Pages |
Abstract
We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Kai Li, Shan-lin Yang,