The car production process is spread into three main production plants – body shop, paint shop and assembly line. There are many groups of scheduling problems formulated for the car production process beginning from CSP (car sequencing problem) to the assembly line balancing. The aim of this paper is to present several combinatorial problems formulation and methods of optimization for each of these production phases applying tasks scheduling theory. As far as the processes in the body shop are concerned, an example of car segmentation problem will be considered. For the paint shop, optimization of number of colours and maximization of car blocks of the same colour are being taken into consideration with the restrictions of the real production process. For the case of assembly line, an example of balancing the assembly line considering the optimization of workers’ assignment will be presented. Even though these problems have previously been formulated in the literature, they do not take into consideration practical issues and real conditions of a car manufacture plant which is the case of our solution proposals.