Dynamic programming algorithms for solving single machine scheduling problems with a fixed complexity time

Abstract EN

We solve in this paper some machine scheduling problems with certain conditions ; the solution had been made by using dynamic programming procedures with a fixed time for all the algorithms.

Some of the algorithms described in the paper represent a modification to some mathematical programming algorithms and some of them are new or a generalization to others.

The optimal solution of all these algorithms will be done with a fixed complexity time, which may lead us to solve them easier and faster.