Rozvrhování v systémech s jedním i více procesory

This paper focuses on characterization of scheduling in systems with one or multiple machines. There are different types of tasks given, with which we can encounter in scheduling. At the beginning, introduce basic concepts of production scheduling. The second chapter is a flowshop problem with its history and projections for the flowshop problem. In the next chapter is a modification of flowshop problem called hybrid flowshop, which is divided according flexibility to hybrid flowshop with processing flexibility and hybrid flowshop with routing flexibility. Another chapter is open shop problem, which have some differences compare with the above mentioned types. The last chapter is a job shop, stating in a graphical solution for two machines and a brief description of the algorithm Shifting bottleneck.