Abstract:

With increasingly individualized customer requirements, manufactured products have the characteristics of small-batch (discrete) production. In the article, the main attention is paid to the topic of general job-shop scheduling (JSSP), since such a problem occurs in manufacturing systems characterized by the type of discrete production. JSSP is an NP-difficult optimization problem, hence the completion time of all jobs was taken as an optimization criterion. The purpose of the article is to present the possibility of improving the planning process using selected methods and tools. It started with simple tools, such as scheduling rules and consideration of transport units of given orders. Then the possibilities of grouping specific orders (or fragments of strings of operations of selected orders) according to the principles of group technology were presented. In this way, the longest common substring of operations of technological marches was extracted. At the stage of prioritizing the execution of production orders, the LPT rule was applied. The production scheduling scheme obtained by the proposed optimization model can improve production efficiency and reduce the completion time of all orders in the production process.