Approximation algorithms for scheduling problems

There are no efficient algorithms for almost of all scheduling problems, especially when practical scheduling models are considered. Further there may be none for multi-objective scheduling problems. So we should take efforts to develop efficient approximate algorithms for multi-objective scheduling problems. The main purpose of this paper is to survey approaches to some scheduling problems from the algorithmic view points till now and investigate some hopeful approximate approaches to multiobjective scheduling problems.