In this paper, the scheduling theory and its applications are considered. The problems with one machine and two machines, as well as the multi-machine problem, are discussed. The schedules are presented by Gantt charts, and the Johnson’s theorem is stated. The calendar planning and the traveling salesman problem, as scheduling-type problems, are also considered.