2023
DOI: 10.3390/electronics12204189
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm

Pengwei Zhou,
Zhiqiang Xie,
Wei Zhou
et al.

Abstract: In the process of the integrated scheduling of multi-variety and small-batch complex products, the process structure and attribute characteristics are often ignored, which affects the overall scheduling effect. Aiming at solving this problem, a heuristic integrated scheduling algorithm (HIS-IDA) based on the improved Dijkstra algorithm is proposed. The algorithm takes the processing time of the process itself as the path value of the preceding and the following adjacent processes. Firstly, the improved Dijkstr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…[10,11]. At present, global path planning algorithms mainly include A* [12], Dijkstra [13], and rapidly-exploring random trees (RRTs) [14]. Local path planning algorithms include the artificial potential field algorithm (APF) [15], DWA [16], and deep learning method (DL) [17].…”
Section: Related Workmentioning
confidence: 99%
“…[10,11]. At present, global path planning algorithms mainly include A* [12], Dijkstra [13], and rapidly-exploring random trees (RRTs) [14]. Local path planning algorithms include the artificial potential field algorithm (APF) [15], DWA [16], and deep learning method (DL) [17].…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, for the third type of product manufacturing scheduling mode with complex constrained processes, integrated scheduling came into being, which can be summarized as follows: (1) the complex process of the product is represented by the treelike structure, (2) the product quantity is single or small batch, (3) the processing and assembly of the product are coordinated [16]. Now a series of research results have been achieved [17][18][19][20][21][22][23][24][25][26]. For example, literature [24] proposed strategies such as sub-tree decomposition to improve the manufacturing efficiency of complex products [24].…”
Section: Introductionmentioning
confidence: 99%
“…The scheduling problem is a classic NP-hard problem [12] and is also one of the key links for the efficient operation of an intelligent production system because dynamic scheduling can optimize several KPIs in the production space; for example, it can reduce the tardiness [13], the cost of storage [14], minimize the makespan [15], reduce the travelling time [16], and benefit other KPIs that change from company to company. Intelligent production has numerous advantages in terms of flexibility, maintainability, and cost.…”
Section: Introductionmentioning
confidence: 99%