Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

Based on the practical application of an enterprise, we address the multistage job shop scheduling problem with several parallel machines in the ﬁrst stage (production), a few parallel machines in the second stage (processing and assembly), and one machine in the following stages (including joint debugging, testing, inspection, and packaging). First, we establish the optimization objective model for the ﬁrst two stages. Then, based on the design of the sequencing algorithm in the ﬁrst two stages, a correction algorithm is designed between the ﬁrst stage and the second stage to solve this problem systematically. Finally, we propose two benchmark approaches to verify the performance of our proposed algorithm. Veriﬁcation of numerical experiments shows that the model and algorithm constructed in this paper eﬀectively improve the production eﬃciency of the enterprise.


Introduction
Multistage scheduling problems are common in the actual production scheduling of enterprises. Since the beginning of the 21st century, with the rapid development of the social economy, the diversified and personalized needs of customers have been increasing daily. e relationship between market supply and demand is gradually changing from a seller's market to a buyer's market, and competition among enterprises is intensifying, forcing enterprises to change their production mode towards diversification, multiple varieties, and small batches. erefore, how to respond quickly, optimize production, and meet customers' needs efficiently and punctually has become the core factor of competition among enterprises. In this context, most enterprises modularize their production according to process characteristics to form a number of production and assembly workshops with specific functions. At this time, the multistage scheduling problem arises in production scheduling. However, most existing research remains theoretical, with few studies on practical application, so there is an urgent need to establish a set of system methods that can be applied to the multistage production enterprise production scheduling mode.
In this study, we focus on the multistage job shop scheduling problem. e constraints (such as processing time and processing sequence) in the process of multistage job shop scheduling are considered to construct a mathematical model for different stages of production scheduling, and both a multistage separated production scheduling algorithm and an improved multistage relevance production scheduling algorithm are designed to solve the proposed problem. Finally, the improved multistage relevance production scheduling algorithm is verified through a computational experiment based on real-world data. Two contributions are made in this paper: (1) in the process of calculating the solution, the theory of scheduling and a heuristic algorithm are combined to obtain a satisfactory multistage production scheduling solution; (2) compared with previous articles, this paper pays more attention to the practical application of mathematical problems in enterprises. It not only improves the production efficiency of multistage manufacturing enterprises but also provides a scientific reference for the production decision-making of enterprises. Furthermore, the approach can create more profits for enterprises. e remainder of this paper is organized as follows. Section 2 reviews the relevant literature on production scheduling. Section 3 builds a model for the multistage job shop scheduling problem. Section 4 designs the corresponding algorithm for the multistage job shop scheduling mode. Section 5 reports the numerical experiments of the model of multistage job shop scheduling, and conclusions are drawn in Section 6. e findings can be used as a reference for production enterprises' decision-making and have good application value.

Literature Review
Production scheduling, which can be defined as to "allocate limited resources to several tasks in time to meet or optimize one or more objectives" [1], is a key task for manufacturing enterprises in implementing production plans. Moreover, production scheduling is an important field in operational research. Since Johnson [2] proposed an effective optimization algorithm for solving N/2/F/Cmax and some special n/3/F/ Cmax problems, many scholars have engaged in production scheduling research. Graves [3] systematically summarized the types of production scheduling based on previous research. According to the processing complexity, he divided production scheduling into four types: one processor, parallel processors, flow shop, and job shop. is classification method has been adopted and quoted by later scholars.
Many scholars engaged in one-processor scheduling and parallel-processor scheduling research in the early stage [4][5][6][7][8], and many scholars are continuing research in this field [9][10][11][12][13][14][15]. Luo et al. [16] studied the single-machine scheduling problem with job-dependent machine deterioration. Chen and Yuan [17] studied the classic single-machine scheduling problem with deadlines based on minimizing the total tardiness and proved that the problem is NP-hard. Luo and Liu [18] focused on the single-machine scheduling problem with workload dependent on maintenance time and extended the previous theoretical results. Atakan et al. [19] studied the single-machine scheduling problem with uncertain parameters. Zhang et al. [20] proposed an unrelated parallel machine scheduling problem based on the consideration of processing speed and processing time, and they verified the effectiveness of their proposed heuristic evolutionary algorithm. Vallada et al. [21] studied the problem of unrelated parallel machines with one additional resource using a scatter search algorithm. Alidaee et al. [22] used dynamic programming to study a parallel machine scheduling model in which the job processing rates are interdependent and jobs have no priority. Vincent et al. [23] studied the capacity-constrained batch problem with multiple projects, set time and unrelated parallel machines, and compared the results with those of Toledo and Armentano [24] to demonstrate the competitiveness of the existing research results.
Meanwhile, scholars represented by Johnson [2] are also studying the multistage production scheduling problem. e development of production modularization and integration in manufacturing enterprises has led to complex relations among production processes, which often affect the progress of the whole production system. Indeed, the multistage flow shop scheduling and multistage job shop scheduling are more in line with the actual needs of enterprises. Multistage flow shop scheduling is applicable to steel manufacturing [25,26], printed circuit boards [27], automobile manufacturing [28], and other enterprises whose products must be produced and processed according to a certain technological process. Multistage job shop scheduling is more common in manufacturing enterprises because of its uncertain processing process [29][30][31][32]. However, due to the lack of practical application background, most scholars are engaged in research from the perspective of improving the speed [33,34] and solution quality [35,36] of multistage production scheduling algorithms. Samarghandi [37] studied the problem of minimizing the maximum completion time of flow shop scheduling under the constraints of a minimum and maximum time delay. By constructing a mixedinteger linear programming model and a constraint programming model, the author proposed a tabu search algorithm and verified the effectiveness of the proposed tabu search algorithm with an example. Gong et al. [38] proposed a hybrid evolutionary algorithm based on the flexibility of workers that considered factors such as energy consumption. Experiments on benchmark examples demonstrated that the proposed algorithm was significantly better than two other well-known algorithms in terms of solution quality and computational efficiency. Caldeira and Gnanavelbabu [39] used an improved Java algorithm to solve a flexible job shop scheduling problem and compared the solution quality with other famous metaheuristic algorithms to verify the superiority of their algorithm. Dabah et al. [40] paralleled the tabu search algorithm to solve the blocking job shop scheduling problem and used data in the existing literature to verify that the designed algorithm can improve upon the best results achieved by a large number of benchmark methods in the literature. Zhang et al. [41] proposed an improved hybrid particle swarm optimization algorithm to study the multiobjective flexible job shop scheduling problem. e benchmark experiment showed that the algorithm has the advantages of high quality and fast convergence.
A literature review finds many research results related to the production scheduling problem. However, the production scheduling problem is characterized by not only many production constraints but also a large number of production sequencing combinations, so a general production scheduling theory is difficult to develop. Existing scholars focus on improving the solution quality of the algorithms and give less attention to the application of the production scheduling model to solve the actual problems of enterprises. erefore, the application of multistage production scheduling to better serve real manufacturing enterprises must be studied.

Problem Description and Model Formulation
3.1. Problem Description. Quality, cost, and delivery time are the three core issues in the production and operation management of enterprises.
is paper focuses on the delivery time to solve a production scheduling problem in which the products go through multiple stages of production before final delivery. In this multistage production, the first two stages are usually the most complex because the product processing techniques of these two stages, which are the key factors affecting the production efficiency, are both independent and influence each other. e subsequent stages are all single-machine operations, so we simply need to sum the standard working hours of each stage. To summarize, we take the first two stages of the production scheduling process as the key content to be studied.

Problem Description of the First-Stage Production
Scheduling.
e first stage usually involves producing intermediate products and providing raw materials for subsequent assembly. Let j workstations produce i parts in this stage. In this process, due to the limited number of processing workstations, there is no specific requirement for prioritizing which type of intermediate products to produce, which leads to many plans for production. However, the processing time for different types and models of intermediate products is different, and intermediate products can be processed at any workstation. At any time, an intermediate product can be processed at most at one workstation, and each workstation can process only one intermediate product at a time. e processing of intermediate products in any processing stage is not allowed to be interrupted. is scenario inevitably leads to different processing times for each workstation to complete the intermediate products. For a complete set of products, the production schedule of the first stage directly affects the assembly time of the second stage, so the production of the first stage must be scheduled carefully.

Problem Description of the Second-Stage Production
Scheduling.
e second stage is the process of product system integration, and the speed of its progress directly affects the delivery time of the final product. erefore, the production of the second stage must also be scheduled. In this stage, l workstation processes workpieces (denoted as set K), and the set K is divided into two subsets (i.e., K � K 1 ∪K 2 ): set K 1 , in which workpieces can be processed directly without waiting time, and set K 2 , in which workpieces have a waiting time. e waiting time is the total time spent in the production and conversion section of intermediate products in the first stage, and when the intermediate products are transferred to the second stage, they should be transferred in the form of subsystems.

Relevance between the First Stage and the Second Stage.
e relevance of the first stage, the second stage, and the third stage can be seen in Figure 1.
e first stage and second stage have obvious relevance in the process of production scheduling.
First, the intermediate product production in the first stage and the no waiting time workpiece from set K 1 in the second stage can be conducted in parallel, and their completion time directly affects the start time of the third stage.
Second, the completion time of the intermediate product processing in the first stage directly affects the start time of the workpiece assembly with waiting time in the second stage.
ird, the workpiece with waiting time in the second stage must be assembled in the form of a subsystem.
Finally, only after all the workpieces are assembled can they be transferred to the third stage.

Model Formulation
During the modeling process, this paper makes some reasonable simplifications, including that the availability of raw materials does not affect the processing process, workstation equipment failure has little impact on processing and can be ignored, the processing time of all intermediate products is known in standard working hours, and there is no disturbance of the processing time caused by the production personnel's emotions. For the convenience of subsequent modeling, we call the processing and assembly of the second-stage workpiece the assembly task.
According to the situation of the first two stages, the optimization objective is to minimize the latest completion time of the assembly task for all assembly stations in the second stage to ensure that all tasks are completed as evenly as possible before the third stage.

Models
(1) Parameter definitions are as follows: I: intermediate product set J: intermediate product processing workstation set K′: subsystem set I k : intermediate product set contained in the k-th subsystem, k ∈ K′ t i : processing time of intermediate product i on the processing workstation, i ∈ I L: assembly workstation set K 1 : assembly task set without waiting time K 2 : assembly task set with waiting time K: assembly task set, K � K 1 ∪K 2 P kl : assembly time of assembly task k on assembly workstation l, k ∈ K, l ∈ L C k : the end of processing time when assembly task k finishes processing in the first stage of intermediate products, k ∈ K (2) Decision variables definition is as follows: S ij : start processing time of intermediate product i on processing workstation j, i ∈ I, j ∈ J.
C ij : end processing time of intermediate product i on processing workstation j, i ∈ I, j ∈ J.
S kl : start assembly time of assembly task k on assembly workstation l, k ∈ K, l ∈ L. C kl : end assembly time of assembly task k on assembly workstation l, k ∈ K, l ∈ L.
(3) Objective function is as follows: (4) Constraints are as follows: Objective function (3) is used to minimize the latest end time of each workstation.
Constraint (4) indicates that an intermediate product can be processed by only one processing workstation. Constraint (5) represents the end processing time of intermediate product i on the processing workstation. Constraint (6) indicates that a single processing workstation cannot process two intermediate products simultaneously. Constraint (7) represents that decision variable S ij is a nonnegative continuous number. Constraint (8) indicates that decision variable X ij is an integer of 0 or 1. Constraint (9) indicates that the start time of the assembly task is later than the end time of the previous operation. ere are two meanings: one is to take C k � 0 for an assembly task that does not need to wait; the other is to take C k > 0 for an assembly task that needs to wait. Constraint (10) indicates that an assembly task can be assembled by only one assembly workstation. Constraint (11) indicates that a single assembly workstation cannot assemble two assembly tasks simultaneously. Constraint (12) shows that the end assembly time of assembly task k on assembly workstation l is the sum of its start assembly time on assembly workstation l and its assembly time on assembly workstation l. Constraint (13) represents that decision variable S kl is a nonnegative continuous number. Constraint (14) indicates that decision variable X kl is an integer of 0 or 1. e above models are difficult to solve with commercial software, and enterprises prefer to obtain a satisfactory solution instead of deliberately pursuing the optimal solution when addressing actual production scheduling problems.
us, a heuristic algorithm is good for multistage production scheduling problems. Multistage production scheduling is usually solved stage by stage, in line with the actual production situation of enterprises. erefore, a multistage heuristic algorithm is designed in this paper.

Scheduling Procedure (Algorithm Design)
According to the actual situation of production, this paper focuses on the first two stages of production scheduling and designs a corresponding scheduling algorithm. Generally, the scheduling process will not start the next stage until the previous stage is completed. Based on this principle, we design two-stage algorithms in Sections 4.1 and 4.2, denoted as S1 and S2. Moreover, according to the relevance description in Section 3.1.3, the algorithm can be further optimized, so we propose an improved algorithm (denoted as S1′) for the first stage; see Section 4.3 for details.

General Idea of the Production Scheduling Algorithm for the First Stage.
In the first stage, the processing sequence of intermediate products and the processing sequence of each subsystem should be determined. e general ideas for the first-stage scheduling algorithm (S1) are as follows.
First, we need to identify and summarize the intermediate products to which each subsystem belongs.
Second, because the processed intermediate products need to be transferred to the second stage in the form of a subsystem, one subsystem must be completed before processing another subsystem; that is, if the intermediate products of one subsystem are being processed, the intermediate products of another subsystem cannot be processed.
Finally, during intermediate product processing, the complexity of each subsystem is directly proportional to its processing time, so we prioritize complex subsystems, which should be transferred to the next stage as soon as possible. We give priority to complex systems, that is, tasks with long processing times, because Tang and Zhao [42] proved that the optimal solution of the maximum processing time can be obtained by performing tasks in descending order of processing time in the same speed machine scheduling problem, which will not be demonstrated here.

Steps of S1
Step 1: all intermediate products are classified according to their subsystems Step 2: the processing times of all intermediate products in set I k are added to obtain M k , namely, M k � i∈I k t i Step 3: all subsystems are sorted in descending order according to M k , namely, M k ≥ M k+1 , ∀k ∈ 1, . . . , Step 4: all intermediate products in set I 1 are sorted in descending order of t i , namely, t i ≥ t i+1 , ∀i ∈ 1, . . . , |I 1 | − 1 Step 5: let k � 1. e first |J| parts are taken and arranged on workstations in sequence; now, let i � |J| + 1 Step 6: if any workstation is processing, the i-th intermediate product in set I k set is assigned to this workstation Step 7: if i > |I k |, then let k � k+1, and go to Step 8; otherwise, go to Step 6, and let i � i+1 Step 8: if k < |K|, then all intermediate products in set I k are sorted in descending order of t i , namely, t i ≥ t i+1 ; let i � 1, and go to Step 6; otherwise, go to Step 9 Step 9: end e time complexity of algorithm S1 is O (mn 3 ), where m represents the number of processing subsystems, that is, m � |K ′ |, and n represents the maximum number of intermediate products in all subsystems, that is, n � max k∈K |I k |. In Step 2, the summation of the processing time for each subsystem occurs no more than n times, so it takes at most mn iterations to obtain the total processing time for m subsystems. In Step 6, Step 7, and Step 8, intermediate product assignment of each subsystem to a workstation occurs no more than mn times. In Step 8, the complexity of the bubble sorting algorithm for each subsystem is O (n 2 ). erefore, the total complexity of algorithm S1 is O (mn) + O (mn 3 ) � O (mn 3 ).

Mathematical Problems in Engineering
First, we need to identify and distinguish the types of tasks.
Second, the tasks without waiting time are sorted in descending order of assembly time.
ird, for tasks requiring waiting time, the waiting time is defined as the time consumed by the corresponding subsystem in the first stage. erefore, the scheduling of tasks requiring waiting time is a dynamic process that should be combined with the scheduling situation of the first stage in Section 4.1.1 and should be changed along with changes in the first stage of scheduling. Additionally, once a task is being assembled, it cannot be interrupted, and the assembly of another task can be started only if the previous task is completed.
Finally, in the second stage, the goal is to balance the workload of each assembly workstation as much as possible. Only after each assembly workstation has completed the assembly task can the product be transferred to the next stage.

Steps of S2
Step 1: all the assembly tasks in the second stage are classified according to their type to form the no waiting time task set K 1 and the waiting time task set K 2 .
Step 4: confirm whether there is an idle assembly workstation; if so, go to Step 5. Otherwise, continue to wait until an idle workstation appears; then, go to Step 5.
Step 5: search task set K 2 to confirm whether there are any tasks to be assembled. If there are tasks to be assembled, assembly task k ′ with the longest assembly time is assigned to the idle assembly workstation; then, k ′ � k ′ + 1. Otherwise, the k-th task in K 1 is assigned to the idle assembly workstation.
Step 7: confirm whether there is an idle assembly workstation; if so, go to Step 8. Otherwise, continue to wait until an idle workstation appears; then, go to Step 8.
Step 8: search task set K 2 to confirm whether there are any tasks to be assembled. If there are tasks to be assembled, assembly task k ′ with the longest assembly time is assigned to the idle assembly workstation; then, k ′ � k ′ + 1. Otherwise, continue to wait until a task to be assembled appears and assign it to the idle workstation.
Step 10: end. e time complexity of algorithm S2 is O(m ′ n ′ 2 ), where m′ represents the number of assembly workstations, that is, m ′ � |L|, and n′ represents the maximum number of the two types of assembly tasks, that is, |L|n ′ � max |K 1 |, |K 2 | . Additionally, m steps are required to confirm the existence of an idle assembly workstation in Step 4.
Step 5 needs |K| times to search set |K|. If there exist tasks to be assembled, the assignment of the task with the longest assembly time takes no more than |K| iterations; otherwise, it will take no more than |K 1 | iterations to assign the task from set K 1 in Step 5 and Step 6. erefore, the complexity of Step 4, Step 5, and Step 6 is O(m ′ n ′ 2 ). Similarly, the complexity of Step 7, Step 8, and Step 9 is O(m ′ |K| 2 ). erefore, the total complexity of algorithm S1 is

Improved Algorithm for the First Stage (S1′)
. e scheduling algorithm design of the second stage will change dynamically with the scheduling of the first stage. Here, we give priority to tasks with longer assembly times, which need to be assembled first, while in the scheduling algorithm design of the first stage, we give priority to subsystems with a longer processing time, which need to be processed first. However, the assembly time and processing time are not the same concept; if the scheduling algorithm of the first stage is directly embedded in the scheduling algorithm of the second stage, it is no longer applicable. erefore, the improved scheduling algorithm of the first stage (S1′) should be adjusted as follows.
Step 1: subsystems I k are sorted in descending order of assembly time P k , namely, P k ≥P k+1 , ∀k ∈ 1,..., |K| − 1 { } Step 2: all intermediate products in set I 1 set are sorted in descending order of t i , namely, t i ≥ t i+1 , ∀i ∈ 1, . . . , |I 1 | − 1 Step 3: let k � 1; the first |J| components are arranged on |J| workstations in turn, and now let i � |J| + 1 Step 4: if any workstation finishes processing, the i-th intermediate product in set I k is assigned to this workstation Step 5: if i > |I k |, then let k � k + 1, and go to Step 6; otherwise, go to Step 4 and let i � i + 1 Step 6: if k < |K|, then all intermediate products in set I k are sorted in descending order of t i , namely, t i ≥ t i+1 ; let i � 1, and go to Step 4; otherwise, go to Step 7 Step 7: end e only difference between S1 and S1′ is the sorting criterion in Step 1; therefore, the complexity of S1′ is the same as that of S1.
In summary, to solve the two-stage production scheduling problem, we propose two combined scheduling algorithms in this chapter: the S1-S2 algorithm and the S1′-S2 algorithm.

Numerical Experiments
Empirical enterprises produce three main types of products (type A, type E, and type F), and all products have to go through multistage production successively. Figure 2 illustrates a schematic of the multistage job shop problem. In the first stage, an intermediate product circuit board is produced, and, in the second stage, cable processing, core component pretreatment, and subsystem assembly are conducted. en, joint debugging, testing, acceptance checking, and packing are performed in the subsequent stage. e entire production process conforms to the mathematical model and algorithm design built in this paper.
In the enterprise, there are four parallel processing workstations in the first stage. e four processing workstations have no sequence when they perform processing tasks, and they are independent of each other. Once an intermediate product begins processing on one of the workstations, it will not be terminated and transferred to another workstation. Furthermore, in the second stage, there are five assembly workstations. e five assembly workstations have no sequence when they perform assembly tasks, and the workstations are independent of each other. Once an assembly task is begun on a workstation, it will not be terminated and transferred to another workstation.

Process
Data. An F-type product with complex technology is selected for empirical research. For reasons of confidentiality, the actual names of the subsystems, intermediate products, and assembly tasks are replaced in the following process data.

Process Data in the First Stage.
e processing time and subsystem details of the first-stage intermediate products are shown in Table 1.

Process Data in the Second Stage.
e assembly time and task type of the second-stage assembly tasks are shown in Table 2.

Process Data in the Subsequent Stage.
After completing the assembly tasks in the second stage, the products are integrated into a set of system products; then, joint debugging, working environment testing, acceptance checking, and packing are conducted in the subsequent stages. Table 3 shows the process data for the subsequent stages.

Comparison Analysis.
To verify the effectiveness of the S1′-S2 algorithm, we propose two benchmark approaches: the S1-S2 algorithm and the actual operation approach of the enterprise.
e operation results of the S1′-S2 algorithm and the S1-S2 algorithm in the first and second stages, which can be seen in Tables 4 and 5, can be obtained using the scheduling algorithm in Section 4. e comparison results are shown in Table 6.  Table 6 shows that 255 working hours are required to complete a single set of F-type products using the S1-S2 algorithm, while 199.5 working hours are required by the S1′-S2 algorithm: the completion time of the S1′-S2 algorithm is 21.76% higher than that of the S1-S2 algorithm.
In terms of the annual output of F-type products, the S1′-S2 algorithm produces 3.59 sets more than the S1-S2 algorithm, and the production efficiency is increased by 24.90%. e annual output of F-type products is obtained as the ratio of the actual working days of the enterprise in the whole year to the production cycle of a single set of F-type products. Two points need to be explained.
First, the working system of the empirical enterprise is a one-day-off system; that is, there is only one day off (Sunday) every week. Based on 52 weeks in a year and deducting 11 days for China national legal holidays, we can obtain the total actual number of working days for the whole year of the empirical enterprise as follows: actual working days � 365 − 11 − 52 � 302 (days).
Second, the working environment testing in the subsequent stages, which costs 56 hours, is completed continuously, so the working environment test actually takes 3 days.
In terms of the annual profit value of F-type products, the S1′-S2 algorithm yields 1.436 million Yuan greater profit than the S1-S2 algorithm, and the profit margin is increased by 24.90%. e reason for the above differences is the different scheduling rules adopted in the production scheduling process. e S1-S2 algorithm isolates the two-stage production scheduling into two separate production stages, and its scheduling algorithm guarantees only the minimum of the latest completion time of each stage. e S1′-S2 algorithm regards the two-stage production scheduling as a whole and forms a link between the stages. Table 4 shows that the latest completion time of the first stage of the S1′-S2 algorithm is 122 working hours and that of the S1-S2 algorithm is 120 working hours. However, in the second stage, the S1′-S2 algorithm gives priority to the assembly time and returns the information of the subsystems with long assembly times to the first stage of the production scheduling, which effectively balances the assembly capacity of each assembly workstation in the second stage.
us, a more satisfactory solution can be obtained.

Comparative
Analysis between the S1′-S2 Algorithm and the Actual Operation of the Enterprise. To verify the effectiveness of the S1′-S2 algorithm, we obtain the output of F-type products from 2015 to 2018. e comparison results between the actual operation of the enterprise and the S1′-S2 algorithm are provided in Table 7.
In Table 7, the output of F-type products is the highest in 2018, reaching 9 sets. e S1′-S2 algorithm can be used to obtain 14.42 sets of annual production, which is 1.6 times the actual production in 2018. erefore, the production capacity of F-type products is improved considerably. In view of the above situation, we analyze the following two reasons for this improvement.    Intermediate product 21 16 16 Intermediate product 12 32 32 Mathematical Problems in Engineering 9 First, in the actual production scheduling process, enterprises usually implement production scheduling according to the production schedule. e production scheduling personnel not only are familiar with the production process of the product but also monitor the firstline production workshop to follow the production progress and take timely and effective adjustment measures to ensure that the production scheduling meets the requirements of the production schedule as much as possible. However, in the process of adjusting production scheduling, due to the different experience of production scheduling personnel, different scheduling rules will be adopted, which results in the balance of orderly production of workstations being broken. In the end, good production capacity cannot be obtained.
Second, the empirical enterprise implements the time work system. Under this condition, production workers inevitably experience inertia that affects their work enthusiasm and initiative and leads to relatively low production efficiency. e S1′-S2 algorithm that we highly recommend is designed from the theoretical perspective. It eliminates the influence of human factors in the    production scheduling process to improve production capacity.
In summary, the effectiveness of the S1′-S2 algorithm is substantially better than that of the S1-S2 algorithm and the actual operation of enterprises, which demonstrates that the empirical enterprise can effectively improve its production capacity and earn greater profits by introducing the S1′-S2 algorithm.
e S1′-S2 algorithm has good reference significance for guiding the actual production scheduling of enterprises.

Conclusions
is paper constructs a multistage production scheduling model and designs a multistage production scheduling algorithm based on sequencing theory by analyzing the relationships among production stages and optimizing each stage. Meanwhile, to verify the effectiveness of the construction model and design algorithm, we conduct numerical experiments that show that the model and algorithm constructed in this paper not only improve the production efficiency of an empirical enterprise but also provide technical support to improve production capacity.
However, the paper considers only static scheduling and not dynamic scheduling. In the actual production scheduling process, it is impossible for the production personnel to work all the time. Moreover, production equipment cannot operate all the time without faults, and not all the raw materials can be delivered on time. erefore, there are many uncertain factors in the production scheduling process. us, one direction of follow-up research will be to improve the adaptability of the production scheduling method.

Data Availability
e data used to support the findings of this study can be found in Tables 1-3 of this paper.

Conflicts of Interest
e authors declare no conflicts of interest.

Authors' Contributions
Conceptualization was performed by Jianzhong Xu and Song Zhang; formal analysis was done by Song Zhang and Yuzhen Hu; investigation was carried out by Song Zhang; methodology was prepared by Song Zhang and Yuzhen Hu; original draft was written by Song Zhang; review and editing were carried out by Song Zhang; supervision was performed by Jianzhong Xu. All authors have read and approved the published version of the manuscript.