The paper presents the task scheduling issue, which main aim is to establish a proper sequence of tasks, that would maximize the utilization of companys production capacity. According to the literature sources, the presented sequencing problem, denoted as CSP (Car Sequencing Problem) belongs to the NP-hard class, as has been proven by simple reduction from Hamiltonians Path problem. Optimal method of solution has not yet been found, only approximate solutions have been offered, especially from the range of evolutionary algorithms. Regardless of specific production system, while considering reception of new tasks into the system, current review of the state of the system is required in order to decide whether and when a new order can be accepted for execution. In this paper, the problem of task scheduling is limited to the specific existing mixed-model production system. The main goal is to determine the effective method of creation of task sequence. Through the use of computational algorithms, and automatic analysis of the resulting sequence, rates of production are able to be checked in a real time, and so improvements can be proposed and implemented.
