Properties of admissible and optimum sequences of performance of works on a single machine

Properties of admissible and optimum sequences of performance of tasks by one machine unser restrictions on terms of the beginning and completion of works are considered. Methods of the formulated problem solution by consecutive algorithms of optimization are offered. The schedules supposing ruptures in performance of works are transformed to optimum sequence in which such ruptures are not supposed. The offered algorithms are illustrated by numerical examples and can successfully be applied to solution of these problems under no restrictions.