Two Parallel-Machine Scheduling Problems with Function Constraint

الملخص EN

The objective of this paper is to minimize both the makespan and the total completion time.

Since parallel-machine scheduling which contains the function constraint problem has been a new issue, this paper explored two parallel-machine scheduling problems with function constraint, which refers to the situation that the two machines have a same function but one of the machines has another.

We pointed out that the function constraint occurs not only in the manufacturing system but also in the service system.

For the makespan problem, we demonstrated that it is NP-hard in the ordinary sense.

In addition, we presented a polynomial time heuristic for this problem and have proved its worst-case ratio is not greater than 5/4.

Furthermore, we simulated the performance of the algorithm through computational testing.

The overall mean percent error of the heuristic is 0.0565%.

The results revealed that the proposed algorithm is quite efficient.

For the total completion time problem, we have proved that it can be solved in On4 time.