Abstract
Scheduling problem is a famous NP-hard combinatorial optimization problem. It is well known to be difficult to get the optimal solution within practical time. The scheduling problem is to decide the execution order of tasks and the resource assignment which achieve the best objective function under given constraints. Usually, the amount of available resources, the precedence relations between tasks, the cost and the time limit of the production are considered in the objective function and the constraints. In this paper, we consider a scheduling problem in which the quality of the task execution is also considered in the objective function and constraints.
