Next Article in Journal
Electromagnetic Interaction Model between an Electric Motor and a Magnetorheological Brake
Next Article in Special Issue
A Review of Game Theory Models to Support Production Planning, Scheduling, Cloud Manufacturing and Sustainable Production Systems
Previous Article in Journal
Collective Creativity and Complexity in Urban Laboratories: El Campo de Cebada
Previous Article in Special Issue
Evaluating the Ranking of Performance Variables in Flexible Manufacturing System through the Best-Worst Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions

1
Department of Technological Equipment, Abylkas Saginov Karaganda Technical University, Karaganda 100027, Kazakhstan
2
Graduate School of Mechanical Engineering, Peter the Great St. Petersburg Polytechnic University, 195251 St. Petersburg, Russia
3
Department of Mechanics and Materials Engineering, Vilnius Gediminas Technical University, LT-10223 Vilnius, Lithuania
*
Author to whom correspondence should be addressed.
Designs 2024, 8(2), 24; https://doi.org/10.3390/designs8020024
Submission received: 15 November 2023 / Revised: 28 February 2024 / Accepted: 29 February 2024 / Published: 8 March 2024
(This article belongs to the Special Issue Mixture of Human and Machine Intelligence in Digital Manufacturing)

Abstract

:
The authors of this article analyze the existing methods and models of technological preparation of machine-building industries. The structure of a three-level simulation model with network-centric control, the structures of individual elements of the simulation model, and the process of simulation modeling are described. The criteria for choosing a rational option for the processing technological route have been determined. During this research, a simulation program was implemented in C++. It allows you to select the optimal scenario for the operation of a production site based on two criteria: time and cost. The volume of implementation is about 2 × 103 lines of code. A diagram of the modeling algorithm for the implemented program and a description of the classes and their interactions are given in the article. The developed simulation model was tested at a machine-building enterprise using the example of the “Pusher” part, manufactured under single-unit production conditions. The technological equipment used for the manufacture of this part was formed in the form of input data of the simulation model. The results of simulation modeling for the selected part are described. For each variant of the technological processing route, the values of variable costs and the duration of the production cycle were determined.

1. Introduction

The prevailing trend in modern production organization involves shifting towards sophisticated digital, intelligent production technologies, and robotic systems. Embedded within this trend is the defining direction for the future of material goods and service production, which revolves around employing production networks featuring network-centric control [1]. Examples of modern production sites are complexes of multifunctional computer numerical control (CNC) machines, 3D printers, and robots, which are integrated into a network to create conditions for effective planning and optimal implementation of parallel technological processes [2,3,4,5].
One characteristic of technological processes is their ability to adapt to small-scale or custom production in various fields such as mechanical engineering, raw material processing, assembly of multi-component products, and so forth [6,7].
Technological preparation of production (hereinafter referred to as TPP) is one of the most important stages of the process for the production of parts. The Chamber of Commerce and Industry provides options for solving problems in many areas: for instance, guaranteeing the feasibility of product design; planning technological processes and crafting technological documentation; designing and producing technological equipment; and the organization and management of the process of technological preparation of production [8]. Typically, production automation and manufacturing processes involve standardizing design elements and technological procedures [9], although in situations of individual or small-scale production, this strategy might not be efficient due to the significant preparatory expenses [10].
The objective of this endeavor is to construct a simulation model aimed at diminishing the duration and labor intensity involved in the technological preparation of individual and small-scale production, thereby enhancing the efficiency of production processes.
To build a new simulation model, it is necessary to use an analysis of various technological processing routes and the corresponding technological machinery used. One of the most effective methods for assessing the many options for technological processes and selecting the most suitable one is simulation modeling of production processes and multi-criteria analysis based on a selected set of criteria [11,12]. When speaking about the technological preparation of production, the authors will further refer to its model.
One of the factors for increasing the efficiency of an enterprise and its competitiveness is the automation of production processes [13]. Production processes also include technological preparation of production, the automation of which through digitalization ensures not only a reduction in production preparation time, but also optimizes the overall costs of manufacturing products. In addition, such automation ensures and allows you to adapt the technological process to changes in external conditions and quickly recalculate the technological process [14].
The main approaches of modern TPP models include the theory of computational complexity, analysis of design and technological elements, analysis of the similarity of design solutions, and a scheduling system.
Complexity theory, as the basis of TPP, allows one to calculate the complexity of a system based on the complexity of the elements included in the system [14,15,16,17,18]. The complexity of the system (S) can be represented as the sum of the products of the complexity of an element of a certain type (Si) and the number of such typical elements (ki):
S = i = 1 n S i · k i
Along with the complexity of individual elements of the system, an assessment is made of the complexity of the relationships between them and the load on the system with connections.
This theory was used as the basis for a number of techniques aimed at increasing the efficiency of the TPP. These methods allow for, based on the analysis of time indicators, the duration of the production cycle and the frequency of inter-operational pauses, while facilitating the design of numerous technological processing routes for a product batch do not enable the estimation of production costs for manufacturing the batch [19].
The theory, based on the analysis of design and technological elements (hereinafter referred to as DTE), makes it possible to increase the efficiency of TPP through various strategies and selection of equipment [20,21,22]. If we imagine the final product as a set of DTEs, i.e., an elementary surface or a set of elementary surfaces that have a common design purpose and are characterized by a common manufacturing route, then the DTE can be described by characteristic parameters. These include the diameter of the DTE, the ratio of the length of the DTE to the total axial length of the part, the location of the material for cylindrical surfaces (inside/outside), the shape of the generatrix for surfaces obtained by rotating the generatrix around the axis of rotation of the part or other features of the shape of the DTE, and the location of the DTE in detail. Assessing the degree of compliance of a cutting tool with a number of criteria allows one to set an algorithm for selecting the optimal set of tools [23].
Different strategies for using a selected set of tools allow you to construct a set of possible outcomes, that is, the order in which these tools are used. Strategies take into account machine processing time and tool change time, its cost, and other costs (for example, the cost of processing an elementary surface).
Using a mathematical apparatus, a multi-criteria optimization problem was formulated, setting the significance of the criteria described above by weighting coefficients (ai) [24]:
J x = i = 1 m a i · f i x ; a > 0 ,   i = 1 m a i = 1 ,  
where  f i x —one of the criteria for the processing strategies under consideration.
This technique makes it possible to construct instrumental strategies for processing DTEs and determine the parameters of the tools used in them. However, this technique does not take into account an important parameter—the accuracy of DTE processing.
The methodology for analyzing the similarity of design solutions during the technological preparation of production is based on the formalization and comparison of design and technological solutions [25,26,27]. The basic concept of this technique includes a technological complex (hereinafter referred to as the T-complex), which is a set of various standard surfaces for which there is a trajectory in which these surfaces can be processed together. Such complexes correspond to certain technological methods, used separately or in combination, depending on the expected production conditions and workmanship. T-complexes are characterized by types of incoming surfaces; indicators of production and operational quality; and external attributes of the connection of this complex with the others. These connections can be represented in the form of a model—a graph, the nodes of which are the identifiers of the selected T-complexes, and the edges are the corresponding connections between them. The connection graph makes it possible to estimate constructive similarity in two ways, including by the composition of T-complex models and the structure of connections of T-complexes [28,29]:
S = 2 m b + c
where S—the value of the selected assessment of the design similarity of the part models.
Depending on the selected method, different values are associated with the parameters.
The disadvantages of this approach include incomplete consideration of the design of the part and its technical parameters and the inability to evaluate many alternative pathways for technological processing. As a result, the length of time for completing the production cycle and the amount of production costs are not determined accurately.
The TPP scheduling system is based on the calculation of time intervals between already planned operations for a given set of parts planned for production in the time period under consideration [30,31,32]. In the process of scheduling, the complexity of performing each operation on specific equipment is assessed: processing time for individual technological operations, as well as the total processing time for a given technological route, and equipment downtime during the processing of technological routes. Thus, based on the results of successfully implemented technological routes, it is possible to determine the most suitable equipment that has the best performance for still unprocessed routes. The criterion of minimizing service time is a solution to the problem of optimizing the production process [33]:
k 1 i = min ( I I S W i j )
where  W i j —time interval between the end of the (j − 1)-th and the beginning of the j-th operation of the i-th part;
Is—many order details S.
Planning is carried out taking into account the loading of technological equipment for processing the ith part.
Minimization of the time required to complete all work on a given set of parts is carried out using the following formula [20]:
k 3 = min ( I I S R i k I ϵ I S F i ) ,
where  R i k —the amount of work that needs to be performed on the i-th order detail S.
With this theory, the planning of technological processes is conducted utilizing the foundation of available data on successful implementations of similar or identical technological processes. Single and small-scale production involves the production of complex products in a small series or single copy, which makes it impossible to use this model. The use of equipment with the highest productivity for all identical technological routes does not allow for optimizing the overall duration of the production cycle, as well as the loading of all available equipment. In addition, this model does not take into account production costs.
Thus, methods based on complexity theory make it possible to design many technological processing routes, but do not allow for estimating production costs for the manufacture of a given batch of products. The methodology for analyzing design and technological elements makes it possible to determine strategies for processing DTE and the necessary parameters and tools used in them. Unfortunately, the parameters used do not take into account the accuracy of DTE processing. Methods based on the method of similarity of design solutions do not allow taking into account the design features and technical parameters of the product. In addition, the methodology does not allow us to evaluate many options for technological processing routes, as well as determine the precise length of the production cycle. The scheduling method does not allow for the correction of the start time of already existing technological routes. This constraint results in a notable limitation on the overall number of potential production scenarios and prevents the selection of the most optimal production process variant.
Therefore, the scientific novelty of this work is the construction of a simulation model that describes the method for selecting the best option for the production process of technological preparation of single and small-scale production based on multi-criteria analysis. The purpose of the article is to enhance the effectiveness of preparing technology for single and small-scale production based on simulation modeling of technological processes. The objectives of the study are to identify the main criteria for choosing a rational variant of the technological process, implement a simulation program for individual and limited-scale production with the possibility of multi-criteria analysis based on selected criteria, and test the implemented program for simulating the manufacture of the “Pusher” part.

2. Materials and Methods

The main task of creating a model is to choose the most suitable scenario for the operation of a production site using the provided information.
It must be taken into account that, depending on the equipment used and processing methods, the same product may have many solutions [34,35].
As part of the work, a generator of implementations of technological processes for the production of a given range of products on a given equipment (hereinafter referred to as ITTP) was built. The main task of the ITTP is to generate the largest possible number of possible implementation options at both the structural and parametric levels.
The generation of various implementations occurs by searching through all possible priorities of processing operations for given technological processes. Each technological process, as well as equipment, is given priority in the form of positive integers. Moreover, as the number increases, the priority increases. The given preferences within the technological process influence the choice of application, while the preferences regarding the equipment determine the sequence in which equipment is selected for executing the technological route. If a request with higher priority arrives while servicing an application, the current application is not interrupted, and the incoming application awaits its turn.
Likewise, priorities establish the order for choosing applications from sources, representing parts associated with specific technological processes, and dictate the sequence for their processing on designated technological equipment.
Upon completing these procedures, the ITPP yields a comprehensive array of implementations, from which suitable options must be chosen to satisfy the relevant decision-maker.
Hence, we encounter a multi-criteria problem with m objective functions delineated on a finite set D [36].
Problems of multi-criteria optimization of technological processes arise at different stages of modeling. Within the framework of a given specific structural implementation of a technological process, “continuous” problems may arise related to the multi-criteria choice in the space of such continuous variables as the processing time of parts on various machines, processing costs, cost of machine downtime, etc. Similar problems can be solved for all possible (generated) structural implementations. At the next level of modeling, when all particular implementations have been optimized according to their controllable parameters, we have a finite set of implementations and each element of this set has a vector estimate—the duration required for executing the technological process, the cost of implementation, the downtime of machines, etc. The number of structural implementations generated can be quite significant.
Thus, the task arises of automating the decision-making process for choosing a rational option for implementing a technological process in accordance with the system of preferences of the decision maker. Such problems belong to “discrete” multi-criteria selection problems.
When designing appropriate decision support systems, one can focus on existing methods of multi-criteria selection [36,37,38,39].

2.1. Structure of the Simulation Model and Description of the Simulation Process

The research methodology and multi-criteria solution are based on the application of Pareto principles and the associated concepts of effective (Pareto optimal) and suboptimal solutions [40,41,42]. We examine a multi-objective optimization issue of the form:
f i x max ,   n p u   x D
f i : D R ,   i = 1 , ,   m ;
D R m
Hence, m functions or functionals fi are provided, which map the set of Dn-dimensional vectors x = (x1, …,) to real numbers R. The selection of optimal values for the controlled parameters (x) is not performed across the entire n-dimensional space Rn, but solely within its subset D.
Equation (8) can be depicted as the optimal parameter selection problem (x1, …, xn) for a system, evaluated based on quality metrics (f1, …, fm). In this context, the constraint xD signifies our technological and other constraints that determine the feasible values for xi. In particular, the processing times for parts on machines and other equipment are obviously non-negative. Certain limitations can be established based on the existing information, which makes it possible to exclude obviously unsuccessful option x from consideration.
To address the outlined multi-criteria problem in this research, we will employ the linear convolution approach.
This technique of “scalarization” (convolution) of Equation (8) enables us to substitute the vector optimality criterion f = (f1, …,) with a scalar criterion J: DR. It relies on the linear amalgamation of all partial objective functionals f1, …, into one [43]:
J x = i = 1 m α i f i x max ;   at   x D ;   α i > 0 ,   i = 1 m α i
In this case, the weighting coefficients αi can be viewed as indicators of the relative significance of individual criterion functionals fi. Giving more weight to a criterion fj implies it should contribute more to the overall sum, hence requiring a higher value for αj. When dealing with significantly disparate criteria, determining the final set of coefficients αi is often challenging and typically relies on informal considerations, typically stemming from the outcomes of expert analysis.
The method outlined above for tackling the posed multi-criteria problem does not pinpoint a single optimal solution. Solutions associated with different sets of weighting coefficients are equally valid elements within sets of effective and suboptimal solutions. These solutions, as per the general framework of the decision problem, represent the cores of the respective binary relations (Pareto’s principle and Slater’s condition), thus fulfilling the requisite criteria. However, from a practical standpoint, such as in problems involving the selection of rational options for organizing technological processes, additional insights into the decision maker’s preferences should be factored in. In this context, the Pareto principle merely serves to refine the pool of potential solution candidates, eliminating clearly inferior options from consideration.
Methods for selecting a single solution to a multi-criteria problem exist and are associated with the use of models and procedures designed to structure and quantitatively describe the subjective opinion of the decision maker (technologist). These methods are not discussed in this paper.

2.2. Description of the Methodology for the Simulation Modeling Process and Development of the Structure of the Simulation Model

The main task is to analyze the maximum possible number of options for processing technological routes for given products, in order to select the optimal work scenario according to two criteria: time and cost of processing.
A simulation model of technological preparation of production can be presented as a model structured into three tiers with network-centric management [43,44,45]:
Level 1: Management of technological macro-operations (hereinafter referred to as MO—these are sequences of messages exchanged between the built-in controllers of first-level objects and second-level computers that control the implementation of the technology) of machine tools and robots. Every component of the production system is supervised, involving evaluating the present condition of each system component, verifying the accurate implementation of ongoing tasks for each component, and transmitting data indicating the beginning or completion of any actions of elements of the production system, as well as errors in their operation. At the first level, control of each element of the production system is carried out.
Level 2: Management and control of technological processes, described in the form of sequences of macro-operations: the interaction of elements of the production system is monitored, as well as the transmission of data on the state of network objects and their environment to the third level. At the second level, the interaction of elements of the production system is monitored, as well as the transmission of data on the state of network objects and their environment to the third level.
Level 3: Hierarchical optimization and planning involving multiple criteria of production processes. At the third level, the “data lake” is analyzed, on the basis of which dynamic planning of the workshop is carried out. When planning, the execution of MO by production network objects is optimized, which takes into account the possibilities of parallel execution of MO, their synchronization, areas of acceptable values of state parameters, conditions for reliable execution of the plan, etc. Since specific success criteria are defined for each operating mode of each network object, the third level must solve the problems of multi-criteria planning, as well as deriving new or changing existing control rules or assessing the state parameters of network objects.
Within the framework of this study, the third level of the model is considered, at which the modeling and analysis of various options for the process of determining the technological processing paths and the corresponding technological equipment utilized for each batch of components is conducted. The model being discussed will be realized in the form of a queuing system, abbreviated as QS [46].
QS are models of systems into which applications (requirements) are received at random times from outside or inside. Each application received into the system must be serviced by the system. The service system is a set of maintenance equipment and personnel with the appropriate organization of the maintenance process. The basic concepts of QS include [47]:
  • A source that generates applications, and a set of sources create the input flow of applications into the system. As a rule, sources can be of two types, finite and infinite, which differ in the methods of generating requests.
  • Buffer memory (storage location of the request queue). As a rule, it is divided into two types: general and zone. The shared memory stores requests from various sources, and the order in which they are recorded is determined only by the buffering discipline. Zone memory is a buffer divided into zones, each of which records requests only from a specific source. Thus, the quantity of zones aligns with the number of sources.
  • Devices that service requests and create an output stream of requests after servicing.
  • Arrangement manager: sends a request for service or to buffer memory if there are no free devices and organizes the refusal or knocking out of an application from the buffer memory if there are no free places left in the buffer.
  • Selection manager: selects the device on which applications will be processed and selects a request from the memory buffer, if it exists there.
Figure 1 shows the standard structure of the QS:
Unlike the standard structure, the following changes were made to the implemented model:
  • In the model, the sources are represented by technological processes (referred to as TP). TP denotes a precise sequence of tasks, starting from the delivery of raw materials and tools from the warehouse to the machines, and concluding with the storage of finished products of specific types at the warehouse. Moreover, the durations of all tasks are explicitly defined.
  • No buffer memory.
  • The system operates seamlessly as it cannot bypass any stages of the process.
  • The quantity of devices in the system is contingent upon the designated technological equipment required for executing the specified technological processes.
  • During the modeling process, applications are generated—a separate stage of the technological process. Simultaneously, the system handles one occurrence of each technological process. Consequently, the quantity of applications within the system does not surpass the overall count of technological processes.

3. Result

Algorithmization of Simulation Modeling

To analyze the widest range of potential technological processing routes for designated products and subsequently select the optimal operational scenario based on processing time and cost criteria, the simulation algorithm can be delineated into four primary phases: user input processing, preparatory phase, generation of implementation options, and selection of the optimal operational scenario (refer to Figure 2 and Figure 3).
User Input: Input data are provided to the simulation model to ensure its proper functioning:
  • A compilation of TPs along with the number of implementations for each, comprising the operation type, time required, and implementation cost.
  • A collection of technological equipment—where one unit of a specified piece of equipment corresponds to one or more types of operations conducted.
Preparatory Stage: this involves the creation of processors and request sources, considering the user-provided information.
Main Stage: This stage encompasses the operation of the ITTP. The process of generating implementation options allows you to generate the largest number of possible implementation scenarios by enumerating the priorities of operations for processing given data. Priorities allow you to set the sequence of selecting applications from sources, that is, parts corresponding to certain technological processes, as well as the sequence of their processing on specified equipment (machines) [48,49].
The optimal operational scenario is determined utilizing the linear convolution technique [50,51].
A simulation model consists of a set of simple elements, designed as basic abstractions. Based on these concepts, it is possible to formulate a basic algorithm for the implemented component of the simulation model.
To implement the TP, it is necessary to consistently perform all its stages. Each such stage can be represented in the form of a simulation model application. The application must contain the following information:
  • The TP’s identification number implemented within the system (indicated by the id_ field);
  • The sequence number of the operation within this TP (id_);
  • The implementation number of the TP (id_);
  • The time when the application enters the system (birth_time_).
Fresh requests within the system await the availability of technological equipment capable of executing the relevant technological operation. Upon submitting a service request, the waiting duration (wait_time_) and the contractor’s identifier (exec_id_) are logged. Consequently, for each implementation of a technological process, it becomes feasible to compute the delay time for executing technological operations. A comprehensive diagram of the Request class is depicted in Figure 4.
TPs are portrayed in the system as application sources, which monitor the number of implementations of a particular TP and generate a unique application identifier. The execution of the TP process is reiterated until the designated number of implementations is accomplished. As the TP stages unfold sequentially, each source furnishes only one application at a time. Consequently, the quantity of requests within the system corresponds to the number of concurrent processing operations. This pool of orders can be managed: for example, you can select orders of a certain type of operation.
The management of the application pool is overseen by the Device_union class. Order sources are depicted through the Device class, while TPs are portrayed by the Process class. Figure 5 presents a comprehensive UML diagram illustrating the detailed relationships among these classes and their interactions with the Request class.
The technological equipment is embodied by the Machine class, encompassing the following details:
  • The designation of the process equipment (captured by the name_attribute);
  • The categories of operations it can execute (line_).
The resources associated with a specific piece of technological equipment are overseen by the Consumer class, which retains data regarding the most recent completed request. The information contained within the application is sufficient for determining the readiness of a particular piece of technological equipment to handle the subsequent application.
Throughout the modeling procedure, the Consumer_union class facilitates the allocation of the requisite unit of technological equipment based on the chosen request, considering the priorities and availability status of the units of technological equipment.
Below is a detailed UML diagram of technological equipment and application processors (Figure 6).
The complete class diagram is shown in Figure 7.

4. Discussion

In existing models based on queuing systems, the production manager sends requests either directly for service or to buffer memory. If there are no free devices, the dispatcher organizes a refusal or the request from the buffer memory. If there are no free places left in the buffer the selection manager selects the device on which the requests will be processed, selects the request from the memory buffer if it is there. This whole process, in turn, makes it difficult to parameterize the state of the network according to specific success criteria for each operating mode of a certain model object. In the model proposed, the quantity of devices within the system is contingent upon the specified technological equipment essential for executing the designated technological processes. Consequently, in this model, there exists no buffer memory, thereby preventing the system from bypassing individual stages of the technological process and ensuring flawless operation. Throughout the modeling phase, applications are generated as a distinct step of the technological process. Concurrently, the system handles a singular instance of each technological process. Hence, the generation of applications within the system is managed in such a manner as to not exceed the overall count of technological processes. The developed simulation model was utilized in simulating the technological preparation of production for mimicking the production of the “Pusher” component.
The manufactured part “Pusher” (Figure 8) has the following technical parameters:
  • Dimensions: maximum diameter 24 mm, length 26 mm;
  • Exact dimensions:
    -
    outer diameter ϕ 24h6 with roughness Ra 0.8;
    -
    internal diameter ϕ 11H8 with roughness Ra 1.6;
    -
    internal threaded surface M8-7H, roughness Ra 3.2.
  • General tolerances for other dimensions: H14, h14, ±IT14/2.
Four types of machines are involved in the processing route:
  • Thun—universal lathes;
  • Tchpu—lathes with numerical control;
  • TFNC—turning and milling machines with numerical control;
  • KSh—cylindrical grinding machines.
Table 1 describes the types of machines and their method for processing technological units.
In accordance with Table 1, the input data for the simulation model for the given equipment were formulated:

4.1. Equipment

(:consumer 0:worker (:machine “mach1”:line (“op1” “op2” “op3” “op4” “op5”):factor 1.0:):)
(:consumer 1:worker (:machine “mach2”:line (“op1” “op2” “op3” “op4” “op5”):factor 1.2:):)
(:consumer 2:worker (:machine “mach3”:line (“op1” “op2” “op3” “op4” “op5”):factor 1.3:):)
(:consumer 3:worker (:machine “mach4”:line (“op6”):factor 1.0:):)
Explanation:
-
Consumer ID—unique identifier for the designated equipment;
-
Operator—details regarding the designated equipment;
-
Machinery—designation of the specified equipment;
-
Operation list—roster of operation types feasible on this equipment;
-
Factor—cost factor (greater values correspond to higher part processing costs on this equipment).
For each block of surfaces, the following sequence of processing of the design and technological elements included in their composition was determined:
  • MB(1/1): DTE(1H-1)1 → DTE(2H/2-1)2 → DTE(2H/1-1)2 → DTE(2H/2-1)1;
  • MB(1/2): DTE(1H-1)2 → DTE(2H/1-4)1;
  • MB(2/1): DTE(2B/1-2)1 → DTE(2B/1-1)2 → DTE(2B/2-1)1 → DTE(1B-1)1;
  • MB(2/2): DTE(2B/1-2)3 → DTE(2B/1-3)4 → DTE(2B/2-2)2 → DTE(1B-1)2 → DTE(1B-2)3;
  • MB(4/1): DTE(4B/1-2)1.
For the “Pusher” part, the following sequence of processing of surface blocks was defined:
MB(1/2) → MB(2/1) → MB(1/1) → MB(2/2) → MB(4/1).
Technological elements are included in the design and technological elements are processed sequentially.
The given surface blocks were divided into final operations (Table 2):
Table 3 shows the relationship between processing methods and their cost and execution time:
In accordance with relation (7) and Table 2 and Table 3, the TP input data for the simulation model were formulated, and the input data of the simulation model for a given technological process are as follows:

4.2. Technological Process

(:device 0:task ((:process “TP-T”:line ((“op4” (:time 40:price 13,600:)) (“op3” (:time 12:price 8200:)) (“op5” (:time 16:price 7400:)) (“op6” (:time 29:price 5800:)) (“op2” (:time 18:price 5600:)) (“op3” (:time 12:price 8200:)) (“op2” (:time 36:price 11,200:)) (“op4” (:time 100:price 34,000:)) (“op2” (:time 18:price 5600:)) “op3” (:time 12:price 8200:)) (“op2” (:time 18:price 5600:)) (“op3” (:time 12:price 8200:)) (“op5” (:time 16:price 7400:)) (“op2” (:time 18:price 5600:)) (“op3” (:time 12:price 8200:)) (“op4” (:time 40:price 13,600:)) (“op3” (:time 12:price 8200:)) (“op2” (:time 18:price 5600:)) (“op1” (:time 32:price 4800:))):) 1):)
Explanation:
-
Device №—identification number of the specified TP;
-
Tsk—information about a given TP;
-
Process—name of the specified TP;
-
Line—list of operations that make up the given TP:
(1)
time—processing time of a given operation;
(2)
price—the cost of processing a given operation.
-
No.—number of implementations of a given TP.
The output of the simulation model is presented in MRD (Machine-readable Data) format, where:
  • id: details concerning the ongoing application;
  • name: TP name;
  • num: current TP part number;
  • step: operation number in progress;
  • type: type of ongoing operation;
  • birth: timestamp of when the current request entered the system;
  • price: cost of the ongoing operation;
  • wait: start time of processing the current request;
  • executor: details regarding the equipment processing the application:
  • name: name of the equipment processing the current request;
  • num: equipment number processing the current request;
  • execution: completion time of application processing;
  • impl_price: cost after the application is processed.
A listing of the final schedule of the simulation model with the main set of cutting tools:

4.3. Part of the Simulation Listing Is Shown Below

(:id (:name TP-T:num 0:step 0:type op4:):birth 0:price 13,600:wait 0:executor (:name mach1:num 0:execution 40:impl_price 13,600:):)
(:id (:name TP-T:num 0:step 1:type op3:):birth 40:price 8200:wait 40:executor (:name mach1:num 0:execution 52:impl_price 8200:):)
(:id ():birth 0:price 0:wait 0:executor ():) (:id (:name TP-T:num 0:step 2:type op5:):birth 52:price 7400:wait 52:executor (:name mach1:num 0:execution 68:impl_price 7400:):)
(:id (:name TP-T:num 0:step 4:type op2:):birth 97:price 5600:wait 97:executor (:name mach1:num 0:execution 115:impl_price 5600:):)
(:id (:name TP-T:num 0:step 5:type op3:):birth 115:price 8200:wait 115:executor (:name mach1:num 0:execution 127:impl_price 8200:):)
(:id (:name TP-T:num 0:step 3:type op6:):birth 68:price 5800:wait 68:executor (:name mach4:num 3:execution 97:impl_price 5800:):)
Res_price:175,000 Res_time: 471
The full listing is provided in Appendix A.
As a result of simulating the production of the “Pusher” part, the optimal scenario for the operation of the production site was selected according to the two criteria of time and cost. The final duration of the production cycle was 471 working hours, and the final value of variable costs was 175,000 conventional units, which confirms that the created algorithm and simulation model are adequate under the conditions of a single production. In the future, it is planned to develop a simulation model with an alternative set of cutting tools. Typically, the choice of cutting tool affects the processing time of the part and its cost.

5. Conclusions

In this article, the authors solved the problem of automating the decision-making process of choosing a rational option for implementing a technological process in accordance with the system of preferences of the decision maker. Such problems belong to “discrete” multi-criteria selection problems.
  • The manuscript scrutinized technological production preparation models outlined in both Russian and international literature. In delving into the scientific literature, models focusing on complexity theory, scrutiny of individual design and technological facets, examination of design solution similarities, and scheduling were analyzed.
Through the examination of various methods and models aimed at enhancing the efficiency of production technological preparation, the following observations emerged:
Multi-criteria analysis is notably absent in the majority of production technological preparation models. The selection of optimal technological processing routes and processing strategies for individual part elements is not elaborated upon; rather, decisions are predominantly based on analyzing production cycle duration or production cost assessments.
2.
Methods for estimating the value of inter-operational breaks, based on the method of mathematical statistics, do not allow an accurate assessment of the duration of the production cycle and a highly accurate prediction of the production time of the product.
3.
Approaches relying on the similarity of design solutions during the design of a technological process fail to consider all the design intricacies of the component and its technical specifications. Moreover, they do not facilitate the assessment of numerous processing route options or the determination of production duration with high precision.
4.
A number of the described methods use a production process planning method based on the analysis of identical operations that have already been implemented in the conditions of a particular enterprise. This method does not provide high accuracy in single and small-scale production types due to the wide variety of design and technological solutions.
5.
In the model of technological production preparation, based on the scheduling method, when forming a production schedule, adjustments to the start time of already existing technological operations are not allowed, which significantly limits the number of simulated production scenarios. Consequently, this does not allow for choosing the most rational option for the production process.
To build a new simulation model, the authors used an analysis of various technological processing routes and the technological equipment used. One of the most effective methods for assessing multiple options for technological processes and selecting the most suitable one is simulation modeling of production processes and multi-criteria analysis based on a selected set of criteria.
Unlike the standard structure, the following changes were made to the implemented model:
  • In the model, the sources are represented by technological processes (referred to as TP). TP embodies a strict sequence of operations, encompassing the delivery of raw materials and tools from the warehouse to the machines, culminating in the retrieval of finished products of specified types at the warehouse. Additionally, the durations of all operations are precisely defined.
  • There is no provision for buffer memory.
  • The system operates flawlessly as it cannot bypass individual stages of the process.
  • The quantity of devices within the system is contingent upon the designated technological equipment essential for executing the specified technological processes.
  • Throughout the modeling process, applications are generated as a distinct step of the technological process. Concurrently, the system handles a singular instance of each technological process. Consequently, the number of applications within the system does not exceed the overall count of technological processes. Following the analysis, a simulation model algorithm was devised, and UML diagrams were crafted to delineate the system structure, classes, attributes, methods, and object relationships.
  • A simulation program was developed in C++ specifically tailored for single and small-scale production, with the objective of automating the technological processing process by automatically generating a plethora of work scenarios and subsequently selecting the optimal scenario for the production site based on two criteria: time and cost.
  • Upon simulating the production of the “Pusher” component, the resultant production cycle lasted 471 working hours, with variable costs totaling 175,000 conventional units.
In the future, based on the obtained structures and algorithms of the network-centered simulation model, and created UML diagrams, it is planned to develop a new software product that will combine the functions of production preparation systems (technical processes, equipment preparation, route development, preparation of operational maps) and MES (production control, schedule tracking, planning, and optimization). The peculiarity of this development will be that it will not be a direct competitor to large narrowly focused products that have a significant cost and in most cases are not available to small and medium-sized businesses, this software product offers a private solution to a number of mechanical engineering problems with low labor intensity of use.
In the following works, the purpose of rational cutting modes will be considered, based on the calculation of the total processing error and the quality loss function according to the Taguchi theory. The issues of assembly production will also be covered. It is planned to develop a methodology for selecting a rational option for the assembly technological route, and the variables that wield the most substantial influence on them, to implement the developed simulation model: mathematical dependencies for determining the production cycle, mathematical dependencies for determining the duration of the production cycle, and mathematical dependencies for determining the amount of costs.

Author Contributions

Acquisition of the financial support for the project leading to this publication; conducting the research and investigation process, specifically performing the experiments, or data/evidence collection, N.S.; application of statistical, mathematical, computational, or other formal techniques to analyze or synthesize study data; verification, whether as a part of the activity or separate, of the overall replication/reproducibility of results/experiments and other research outputs, T.N.; development or design of methodology; provision of study materials, G.Z.; scrub data and maintain research data (including software code, where it is necessary for interpreting the data itself) for initial use and later re-use; preparation, creation, and/or presentation of the published work, specifically visualization/data presentation, K.I.; oversight and leadership responsibility for the research activity planning and execution, including mentorship external to the core team and creation of models, V.Y.; conducting the research and investigation process, specifically performing the experiments, or data/evidence collection, O.Č.; management and coordination responsibility for the research activity planning and execution; preparation, creation, and/or presentation of the published work by those from the original research group, specifically critical review, commentary, or revision, including pre- or post-publication stages, O.Z.; programming and software development, E.D.; designing computer programs and implementation of the computer code and supporting algorithms, E.D.; designing computer programs; implementation of the computer code and supporting algorithms, A.B.; testing of existing code components, S.V.; preparation, creation and/or presentation of the published work, specifically writing the initial draft (including substantive translation), M.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. AP14972804) “Development of Software for Technological Preparation of Production on the Basis of the Formalized Design Methodology” (Head N.A. Savelyeva).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Appendix A

(:id (:name TP-T:num 0:step 6:type op2:):birth 127:price 11,200:wait 127:executor (:name mach1:num 0:execution 163:impl_price 11,200:):)
(:id (:name TP-T:num 0:step 7:type op4:):birth 163:price 34,000:wait 163:executor (:name mach1:num 0:execution 263:impl_price 34,000:):)
(:id (:name TP-T:num 0:step 8:type op2:):birth 263:price 5600:wait 263:executor (:name mach1:num 0:execution 281:impl_price 5600:):)
(:id (:name TP-T:num 0:step 9:type op3:):birth 281:price 8200:wait 281:executor (:name mach1:num 0:execution 293:impl_price 8200:):)
(:id (:name TP-T:num 0:step 10:type op2:):birth 293:price 5600:wait 293:executor (:name mach1:num 0:execution 311:impl_price 5600:):)
(:id (:name TP-T:num 0:step 11:type op3:):birth 311:price 8200:wait 311:executor (:name mach1:num 0:execution 323:impl_price 8200:):)
(:id (:name TP-T:num 0:step 12:type op5:):birth 323:price 7400:wait 323:executor (:name mach1:num 0:execution 339:impl_price 7400:):)
(:id (:name TP-T:num 0:step 13:type op2:):birth 339:price 5600:wait 339:executor (:name mach1:num 0:execution 357:impl_price 5600:):)
(:id (:name TP-T:num 0:step 14:type op3:):birth 357:price 8200:wait 357:executor (:name mach1:num 0:execution 369:impl_price 8200:):)
(:id (:name TP-T:num 0:step 15:type op4:):birth 369:price 13,600:wait 369:executor (:name mach1:num 0:execution 409:impl_price 13,600:):)
(:id (:name TP-T:num 0:step 16:type op3:):birth 409:price 8200:wait 409:executor (:name mach1:num 0:execution 421:impl_price 8200:):)
(:id (:name TP-T:num 0:step 17:type op2:):birth 421:price 5600:wait 421:executor (:name mach1:num 0:execution 439:impl_price 5600:):)
(:id (:name TP-T:num 0:step 18:type op1:):birth 439:price 4800:wait 439:executor (:name mach1:num 0:execution 471:impl_price 4800:):)
(:id (:name TP-T:num 0:step 3:type op6:):birth 68:price 5800:wait 68:executor (:name mach4:num 3:execution 97:impl_price 5800:):)
(:id (:name TP-T:num 0:step 0:type op4:):birth 0:price 13,600:wait 0:executor (:name mach1:num 0:execution 40:impl_price 13,600:):)
(:id (:name TP-T:num 0:step 1:type op3:):birth 40:price 8200:wait 40:executor (:name mach1:num 0:execution 52:impl_price 8200:):)
(:id (:name TP-T:num 0:step 2:type op5:):birth 52:price 7400:wait 52:executor (:name mach1:num 0:execution 68:impl_price 7400:):)
(:id (:name TP-T:num 0:step 4:type op2:):birth 97:price 5600:wait 97:executor (:name mach1:num 0:execution 115:impl_price 5600:):)
(:id (:name TP-T:num 0:step 5:type op3:):birth 115:price 8200:wait 115:executor (:name mach1:num 0:execution 127:impl_price 8200:):)
(:id (:name TP-T:num 0:step 6:type op2:):birth 127:price 11,200:wait 127:executor (:name mach1:num 0:execution 163:impl_price 11,200:):)
(:id (:name TP-T:num 0:step 7:type op4:):birth 163:price 34,000:wait 163:executor (:name mach1:num 0:execution 263:impl_price 34,000:):)
(:id (:name TP-T:num 0:step 8:type op2:):birth 263:price 5600:wait 263:executor (:name mach1:num 0:execution 281:impl_price 5600:):)
(:id (:name TP-T:num 0:step 9:type op3:):birth 281:price 8200:wait 281:executor (:name mach1:num 0:execution 293:impl_price 8200:):)
(:id (:name TP-T:num 0:step 10:type op2:):birth 293:price 5600:wait 293:executor (:name mach1:num 0:execution 311:impl_price 5600:):)
(:id (:name TP-T:num 0:step 11:type op3:):birth 311:price 8200:wait 311:executor (:name mach1:num 0:execution 323:impl_price 8200:):)
(:id (:name TP-T:num 0:step 12:type op5:):birth 323:price 7400:wait 323:executor (:name mach1:num 0:execution 339:impl_price 7400:):)
(:id (:name TP-T:num 0:step 13:type op2:):birth 339:price 5600:wait 339:executor (:name mach1:num 0:execution 357:impl_price 5600:):)
(:id (:name TP-T:num 0:step 14:type op3:):birth 357:price 8200:wait 357:executor (:name mach1:num 0:execution 369:impl_price 8200:):)
(:id (:name TP-T:num 0:step 15:type op4:):birth 369:price 13,600:wait 369:executor (:name mach1:num 0:execution 409:impl_price 136,00:):)
(:id (:name TP-T:num 0:step 16:type op3:):birth 409:price 8200:wait 409:executor (:name mach1:num 0:execution 421:impl_price 8200:):)
(:id (:name TP-T:num 0:step 17:type op2:):birth 421:price 5600:wait 421:executor (:name mach1:num 0:execution 439:impl_price 5600:):)
(:id (:name TP-T:num 0:step 18:type op1:):birth 439:price 4800:wait 439:executor (:name mach1:num 0:execution 471:impl_price 4800:):)
(:id (:name TP-T:num 0:step 3:type op6:):birth 68:price 5800:wait 68:executor (:name mach4:num 3:execution 97:impl_price 5800:):)
Res_price:175,000 Res_time: 471

References

  1. Chernorutsky, I.; Kotlyarov, V.; Shyamasundar, R.; Tolstoles, A.; Voinov, N. Implementation of reliable net-centric management of IoT industrial workshop for small-scale production. IOP Conf. Ser. Mater. Sci. Eng. 2018, 497, 012040. [Google Scholar] [CrossRef]
  2. Manzei, C.; Schleupner, L.; Heinze, R. Industrie 4.0 im Internationalen Kontext: Kernkonzepte, Ergebnisse, Trends; VDE VERLAG GmbH: Berlin, Germany, 2016; p. 261. [Google Scholar]
  3. Marcos, M.P.; Pitarch, J.L.; de Prada, C. Integrated Process Re-Design with Operation in the Digital Era: Illustration through an Industrial Case Study. Processes 2021, 9, 1203. [Google Scholar] [CrossRef]
  4. Bako, B.; Božek, P. Trends in simulation and planning of manufacturing companies. Procedia Eng. 2016, 149, 571–575. [Google Scholar] [CrossRef]
  5. Chlebus, E.; Krot, K. CAD 3D models decomposition in manufacturing processes. Arch. Civ. Mech. Eng. 2016, 16, 20–29. [Google Scholar] [CrossRef]
  6. Adam, R.; Kotze, P.; Van der Merwe, A. Acceptance of enterprise resource planning systems by small manufacturing Enterprises. In Proceedings of the 13th International Conference on Enterprise Information Systems, Beijing, China, 8–11 June 2011; Volume 1. [Google Scholar] [CrossRef]
  7. Browne, J.; O’Kelly, M.E.J.; Davies, B.J. Scheduling in a batch or job shop production environment. Eng. Manag. Int. 1982, 1, 173–184. [Google Scholar] [CrossRef]
  8. Burdo, G.B. Improving the technological preparations for manufacturing production. Russ. Eng. Res. Vol. 2017, 37, 49–56. [Google Scholar] [CrossRef]
  9. Siderska, J. Application of tecnomatix plant simulation for modeling production and logistics processes. Bus. Manag. Educ. 2016, 14, 64–73. [Google Scholar] [CrossRef]
  10. Dong, S.; Medeiros, D.J. Minimising schedule cost via simulation optimization: An application in pipe manufacturing. Int. J. Prod. Res. 2012, 50, 831–841. [Google Scholar] [CrossRef]
  11. San Cristobal, J.R. Critical Path Definition Using Multicriteria Decision Making: Promethee Method. J. Constr. Eng. Manag. 2013, 29, 158–163. [Google Scholar] [CrossRef]
  12. Jato-Espino, D.; Castillo-Lopez, E.; Rodriguez-Hernandez, J.; Canteras-Jordana, J. A review of application of multi-criteria decision making methods in construction. Autom. Constr. 2014, 45, 151–162. [Google Scholar] [CrossRef]
  13. Rosova, A.; Behun, M.; Khouri, S.; Cehlar, M.; Ferencz, V.; Sofranko, M. Case study: The simulation modeling to improve the efficiency and performance of production process. Wirel. Netw. 2022, 28, 863–872. [Google Scholar] [CrossRef]
  14. Pompeev, K.P.; Timofeeva, O.S.; Yablochnikov, E.I.; Volosatova, E.E. Methods of Parts Digital Models Design for Problems Resolving in Technological Preparation of Production. In Advances in Mechanical Engineering; Lecture Notes in Mechanical Engineering; Evgrafov, A.N., Ed.; Springer: Berlin/Heidelberg, Germany, 2022; pp. 129–139. [Google Scholar] [CrossRef]
  15. Torres-Jimenez, J.; Rangel-Valdez, N.; De-la-Torre, M.; Avila-George, H. An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries. Appl. Sci. 2022, 12, 4569. [Google Scholar] [CrossRef]
  16. Sipser, M. Introduction to the Theory of Computation, 2nd ed.; Thomson: Boston, MA, USA, 2006; p. 418. ISBN 0-534-95097-3. [Google Scholar]
  17. Abramov, S.A. Lectures on the Complexity of Algorithms, 3rd ed.; MTsNMO: Moscow, Russia, 2020; p. 256. ISBN 978-5-443-91464-0. [Google Scholar]
  18. Kalyakulin, S.Y.; Kuzmin, V.V.; Mitin, E.V.; Suldin, S.P.; Tyurbeeva, T.B. Designing the Structure of Technological Processes Based on Synthesis. Mordovia Univ. Bull. 2018, 28, 77–84. [Google Scholar] [CrossRef]
  19. Khrustaleva, I.N.; Lyubomudrov, S.A.; Chernykh, L.G.; Stepanov, S.N.; Larionova, T.A. Automating production engineering for custom and small-batch production on the basis of simulation modeling. J. Phys. Conf. Ser. 2021, 1753, 012047. [Google Scholar] [CrossRef]
  20. Ivanov, V.; Botko, F.; Kolos, V.; Pavlenko, I.; Hatala, M.; Antosz, K.; Trojanowska, J. Locating Chart Choice Based on the Decision-Making Approach. Materials 2022, 15, 3557. [Google Scholar] [CrossRef] [PubMed]
  21. Trojanowska, J.; Kolinski, A.; Galusik, D.; Rocha Varela, L. A methodology of improvement of manufacturing productivity through increasing operational efficiency of the production process. In Advances in Manufacturing; Springer: Berlin/Heidelberg, Germany, 2018; pp. 23–32. [Google Scholar] [CrossRef]
  22. Araujo, A.F.; Varela, M.L.; Gomes, M.S.; Barreto, R.C.; Trojanowska, J. Development of an intelligent and automated system for lean industrial production, adding maximum productivity and efficiency in the production process. In Advances in Manufacturing; Springer: Berlin/Heidelberg, Germany, 2018; pp. 131–140. [Google Scholar] [CrossRef]
  23. Vukelic, D.; Zuperl, U.; Hodolic, J. Complex system for fixture selection, modification, and design. Int. J. Adv. Manuf. Technol. 2009, 45, 731–748. [Google Scholar] [CrossRef]
  24. Abouel Nasr, E.; Al-Ahmari, A.; Khan, A.A.; Mian, S.H. Integrated system for automation of process, fixture and inspection planning. J. Braz. Soc. Mech. Sci. Eng. 2020, 42, 52. [Google Scholar] [CrossRef]
  25. Liu, M.; Zhou, B.; Li, J.; Li, X.; Bao, J. A Knowledge Graph-Based Approach for Assembly Sequence Recommendations for Wind Turbines. Machines 2023, 11, 930. [Google Scholar] [CrossRef]
  26. Chen, Z.; Bao, J.; Zheng, X.; Liu, T. Assembly information model based on knowledge graph. J. Shanghai Jiaotong Univ. 2020, 25, 578–588. [Google Scholar] [CrossRef]
  27. Li, X.; Zhang, S.; Huang, R.; Huang, B.; Xu, C.; Kuang, B. Structured modeling of heterogeneous CAM model based on process knowledge graph. Int. J. Adv. Manuf. Technol. 2018, 96, 4173–4193. [Google Scholar] [CrossRef]
  28. Xu, Z.; Liu, H.; Li, J.; Zhang, Q.; Tang, Y. CKGAT: Collaborative Knowledge-Aware Graph Attention Network for Top-N Recommendation. Appl. Sci. 2022, 12, 1669. [Google Scholar] [CrossRef]
  29. Han, Z.; Mo, R.; Hao, L. Clustering and retrieval of mechanical CAD assembly models based on multi-source attributes information. Robot. Comput. Integr. Manuf. 2019, 58, 220–229. [Google Scholar] [CrossRef]
  30. Stavropoulos, P.; Papacharalampopoulos, A.; Sabatakakis, K. Data Attributes in Quality Monitoring of Manufacturing Processes: The Welding Case. Appl. Sci. 2023, 13, 10580. [Google Scholar] [CrossRef]
  31. Wang, X.; Liu, M.; Zhong, P.; Zhang, C.; Zhang, D. A Discrete Cooperative Control Method for Production Scheduling Problem of Assembly Manufacturing System. Sustainability 2023, 15, 13785. [Google Scholar] [CrossRef]
  32. Xiong, H.; Shi, S.; Ren, D.; Hu, J. A survey of job shop scheduling problem: The types and models. Comput. Oper. Res. 2022, 142, 105731. [Google Scholar] [CrossRef]
  33. Mokhtari, H.; Hasani, A. An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput. Chem. Eng. 2017, 104, 339–352. [Google Scholar] [CrossRef]
  34. Ciurana, J.; Garcia-Romeu, M.L.; Ferrer, I.; Casadesus, M. A model for integrating process planning and production planning and control in machining processes. Robot. Comput. Integr. Manuf. 2008, 24, 532–544. [Google Scholar] [CrossRef]
  35. García-Leon, A.A.; Dauzère-Pérès, S.; Mati, Y. An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 2019, 108, 187–200. [Google Scholar] [CrossRef]
  36. Knopp, S.; Dauzère-Pérès, S.; Yugma, C. A batch-oblivious approach for Complex Job-Shop scheduling problems. Eur. J. Oper. Res. 2017, 263, 50–61. [Google Scholar] [CrossRef]
  37. Azzouz, A.; Ennigrou, M.; Ben Said, L. A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. Procedia Comput. Sci. 2017, 112, 457–466. [Google Scholar] [CrossRef]
  38. Xing, L.N.; Chen, Y.W.; Yang, K.W. An efficient search method for multi-objective flexible job shop scheduling problems. J. Intell. Manuf. 2009, 20, 283–293. [Google Scholar] [CrossRef]
  39. Shen, X.N.; Han, Y.; Fu, J.Z. Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft Comput. 2017, 21, 6531–6554. [Google Scholar] [CrossRef]
  40. Fernández Pérez, M.A.; Raupp, F.M.P. A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. J. Intell. Manuf. 2016, 27, 409–416. [Google Scholar] [CrossRef]
  41. Moslehi, G.; Mahnam, M. A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 2011, 129, 14–22. [Google Scholar] [CrossRef]
  42. Kacem, I.; Hammadi, S.; Borne, P. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 2002, 60, 245–276. [Google Scholar] [CrossRef]
  43. Gunantara, N. A review of multi-objective optimization: Methods and its applications. Cogent Eng. 2018, 5, 1502242. [Google Scholar] [CrossRef]
  44. Ondov, M.; Rosova, A.; Sofranko, M.; Feher, J.; Cambal, J.; Feckova Skrabulakova, E. Redesigning the Production Process Using Simulation for Sustainable Development of the Enterprise. Sustainability 2022, 14, 1514. [Google Scholar] [CrossRef]
  45. Iassinovski, S.; Artiba, A.; Fagnart, C. A generic production rules-based system for on-line simulation, decision making and discrete process control. Int. J. Prod. Econ. 2008, 112, 62–76. [Google Scholar] [CrossRef]
  46. Bernard, A.; Perry, N. Fundamental concepts of product/technology/process informational integration for process modelling and process planning. Int. J. Comput. Integr. Manuf. 2003, 16, 557–565. [Google Scholar] [CrossRef]
  47. Shah, D.; Shin, J. Randomized scheduling algorithm for queueing networks. Ann. Appl. Probab 2012, 22, 128–171. [Google Scholar] [CrossRef]
  48. Bathaee, M.; Nozari, H.; Szmelter-Jarosz, A. Designing a New Location-Allocation and Routing Model with Simultaneous Pick-Up and Delivery in a Closed-Loop Supply Chain Network under Uncertainty. Logistics 2023, 7, 3. [Google Scholar] [CrossRef]
  49. Malega, P.; Gazda, V.; Rudy, V. Optimization of production system in plant simulation. Simulation 2022, 98, 295–306. [Google Scholar] [CrossRef]
  50. Kuznetsov, P.M.; Khoroshko, L.L. Digitalization of Multi-Object Technological Projecting in Terms of Small Batch Production. Inventions 2020, 5, 38. [Google Scholar] [CrossRef]
  51. Simunovic, G.; Majdandzic, N.; Simunovic, K.; Lujic, R. Applying of the Typical Technological Operations in the Single Production. In AMST’02 Advanced Manufacturing Systems and Technology; International Centre for Mechanical Sciences; Kulianic, E., Ed.; Springer: Vienna, Austria, 2002; Volume 437, pp. 275–281. [Google Scholar] [CrossRef]
Figure 1. An example of the structure of a queuing system, where Иi (i = 1 … n)—sources, PM—production manager, MB—memory buffer, SM—selection manager, Пi (i = 1 … m)—device.
Figure 1. An example of the structure of a queuing system, where Иi (i = 1 … n)—sources, PM—production manager, MB—memory buffer, SM—selection manager, Пi (i = 1 … m)—device.
Designs 08 00024 g001
Figure 2. Simulation model algorithm diagram.
Figure 2. Simulation model algorithm diagram.
Designs 08 00024 g002
Figure 3. Scheme of the technology process description algorithm (TP).
Figure 3. Scheme of the technology process description algorithm (TP).
Designs 08 00024 g003
Figure 4. UML diagram of the Request class.
Figure 4. UML diagram of the Request class.
Designs 08 00024 g004
Figure 5. UML diagram of technological processes and sources of requests.
Figure 5. UML diagram of technological processes and sources of requests.
Designs 08 00024 g005
Figure 6. UML diagram of technological equipment and application processors.
Figure 6. UML diagram of technological equipment and application processors.
Designs 08 00024 g006
Figure 7. UML diagram of the complete simulation model.
Figure 7. UML diagram of the complete simulation model.
Designs 08 00024 g007
Figure 8. Solid model of the “Pusher” part.
Figure 8. Solid model of the “Pusher” part.
Designs 08 00024 g008
Table 1. Varieties of machine tools utilized and their machining techniques.
Table 1. Varieties of machine tools utilized and their machining techniques.
Machine TypeType of Machinery DesignationMachining TechniqueDesignation of Processing Method
1Tunmach1tapping threadsop1
drillingop2
semi-finish turningop3
rough turningop4
finishing turningop5
2TCNCmach2tapping threadsop1
drillingop2
semi-finish turningop3
rough turningop4
finishing turningop5
3TFCNCmach3tapping threadsop1
drillingop2
semi-finish turningop3
rough turningop4
finishing turningop5
pre-op6
grinding
4KSmach4tapping threadsop1
Table 2. Analysis of surface blocks for final operations.
Table 2. Analysis of surface blocks for final operations.
Block of
Surfaces
DTEProcessing MethodMachining Process Identification
1MB(1/2)1DTE(1H-1)2 rough turningop4
2DTE(2H/1-4)1 re-grindingop6
rough turningop4
semi-finish turningop3
finishing turningop5
2MB(2/1)1DTE(2B/1-2)1 drillingop2
semi-finish turningop3
2DTE(2B/1-1)2 drillingop2
3DTE(2B/2-1)1 drillingop2
4DTE(1B-1)1 rough turningop4
3MB(1/1)1DTE(1H-1)1 rough turningop4
2DTE(2H/2-1)2 rough turningop4
3DTE(2H/1-1)2 rough turningop4
4DTE(2H/2-1)1 rough turningop4
4MB(2/2)1DTE(2B/1-2)3 drillingop2
semi-finish turningop3
2DTE(2B/1-3)4 drillingop2
semi-finish turningop3
rough turningop5
3DTE(2B/2-2)2 drillingop2
semi-finish turningop3
4DTE(1B-1)2 rough turningop4
5DTE(1B-2)3 rough turningop4
semi-finish turningop3
5MB(4/1)1DTE(4B/1-2)1 drillingop2
thread cuttingop1
Table 3. Correlation of processing methods with cost and execution time.
Table 3. Correlation of processing methods with cost and execution time.
Designation of Processing MethodProcessing MethodProcessing Time (Working Hours)Amount of Costs (Conventional Units)
1op1tapping threads324800
2op2drilling185600
3op3semi-finish turning128200
4op4rough turning206800
5op5finishing turning167400
6op6re-grinding295800
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Savelyeva, N.; Nikonova, T.; Zhetessova, G.; Irina, K.; Yurchenko, V.; Černašėjus, O.; Zharkevich, O.; Dandybaev, E.; Berg, A.; Vassenkin, S.; et al. Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions. Designs 2024, 8, 24. https://doi.org/10.3390/designs8020024

AMA Style

Savelyeva N, Nikonova T, Zhetessova G, Irina K, Yurchenko V, Černašėjus O, Zharkevich O, Dandybaev E, Berg A, Vassenkin S, et al. Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions. Designs. 2024; 8(2):24. https://doi.org/10.3390/designs8020024

Chicago/Turabian Style

Savelyeva, Nadezhda, Tatyana Nikonova, Gulnara Zhetessova, Khrustaleva Irina, Vassiliy Yurchenko, Olegas Černašėjus, Olga Zharkevich, Essim Dandybaev, Andrey Berg, Sergey Vassenkin, and et al. 2024. "Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions" Designs 8, no. 2: 24. https://doi.org/10.3390/designs8020024

APA Style

Savelyeva, N., Nikonova, T., Zhetessova, G., Irina, K., Yurchenko, V., Černašėjus, O., Zharkevich, O., Dandybaev, E., Berg, A., Vassenkin, S., & Baimuldin, M. (2024). Implementation of Simulation Modeling of Single and High-Volume Machine-Building Productions. Designs, 8(2), 24. https://doi.org/10.3390/designs8020024

Article Metrics

Back to TopTop