A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route
For the scheduling problem of complex products in multi-workshop production, this paper studied the BOM (Bill of Materials) structure of complex products and the characteristics of the process route and developed the construction method of a multi-level process network diagram. Based on this, a comp...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-05-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/11/5078 |
id |
doaj-5bdb27cb06c84f84bfc9be9f6fdaf9da |
---|---|
record_format |
Article |
spelling |
doaj-5bdb27cb06c84f84bfc9be9f6fdaf9da2021-06-01T01:41:49ZengMDPI AGApplied Sciences2076-34172021-05-01115078507810.3390/app11115078A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process RouteLihong Qiao0Zhenwei Zhang1Zhicheng Huang2School of Mechanical Engineering and Automation, Beihang University, Beijing 100083, ChinaSchool of Mechanical Engineering and Automation, Beihang University, Beijing 100083, ChinaSchool of Mechanical Engineering and Automation, Beihang University, Beijing 100083, ChinaFor the scheduling problem of complex products in multi-workshop production, this paper studied the BOM (Bill of Materials) structure of complex products and the characteristics of the process route and developed the construction method of a multi-level process network diagram. Based on this, a comprehensive mathematical model for scheduling on multi-workshop production was proposed. An improved particle swarm algorithm (PSO) was proposed to solve the problem. By constructing the network subgraph, the invalid search path of the algorithm was avoided, and the efficiency of the algorithm was improved. In addition, for the scheduling problem with product time constraints, this paper presented a path search rescheduling strategy to ensure that the algorithm could obtain an effective search path. Finally, the model and algorithm were verified through a case study. This paper optimized the parameters of the algorithm by different tests and obtained the optimal range of the parameters. At the same time, through the analysis of the scheduling of complex products in a multi-workshop environment, the effectiveness and practicability of the above methods were verified.https://www.mdpi.com/2076-3417/11/11/5078scheduling algorithmmulti-workshop productioncomplex productsBOMprocess network diagram |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lihong Qiao Zhenwei Zhang Zhicheng Huang |
spellingShingle |
Lihong Qiao Zhenwei Zhang Zhicheng Huang A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route Applied Sciences scheduling algorithm multi-workshop production complex products BOM process network diagram |
author_facet |
Lihong Qiao Zhenwei Zhang Zhicheng Huang |
author_sort |
Lihong Qiao |
title |
A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route |
title_short |
A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route |
title_full |
A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route |
title_fullStr |
A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route |
title_full_unstemmed |
A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route |
title_sort |
scheduling algorithm for multi-workshop production based on bom and process route |
publisher |
MDPI AG |
series |
Applied Sciences |
issn |
2076-3417 |
publishDate |
2021-05-01 |
description |
For the scheduling problem of complex products in multi-workshop production, this paper studied the BOM (Bill of Materials) structure of complex products and the characteristics of the process route and developed the construction method of a multi-level process network diagram. Based on this, a comprehensive mathematical model for scheduling on multi-workshop production was proposed. An improved particle swarm algorithm (PSO) was proposed to solve the problem. By constructing the network subgraph, the invalid search path of the algorithm was avoided, and the efficiency of the algorithm was improved. In addition, for the scheduling problem with product time constraints, this paper presented a path search rescheduling strategy to ensure that the algorithm could obtain an effective search path. Finally, the model and algorithm were verified through a case study. This paper optimized the parameters of the algorithm by different tests and obtained the optimal range of the parameters. At the same time, through the analysis of the scheduling of complex products in a multi-workshop environment, the effectiveness and practicability of the above methods were verified. |
topic |
scheduling algorithm multi-workshop production complex products BOM process network diagram |
url |
https://www.mdpi.com/2076-3417/11/11/5078 |
work_keys_str_mv |
AT lihongqiao aschedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute AT zhenweizhang aschedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute AT zhichenghuang aschedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute AT lihongqiao schedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute AT zhenweizhang schedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute AT zhichenghuang schedulingalgorithmformultiworkshopproductionbasedonbomandprocessroute |
_version_ |
1721411785987194880 |