Javascript must be enabled to continue!
An algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device
View through CrossRef
Abstract
Aiming at the defect that quasi critical path algorithm can't take into account both vertical scheduling and horizontal scheduling when scheduling products, this paper proposes an algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device. The algorithm takes the scheduling scheme formed by the quasi critical path strategy as the basic scheduling scheme, proposes and applies the adjacent parallel processes interchange strategy and the adjacent parallel processes adjustment strategy, generates several new product scheduling schemes, and adds them to the product scheduling scheme set. Finally, according to the optimal product scheduling scheme selection strategy, the product scheduling scheme with the minimum total processing time is selected as the final scheduling scheme. The proposed algorithm ensures the compactness of the serial processes, improves the parallel processing of the parallel processes, and optimizes the scheduling results.
Title: An algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device
Description:
Abstract
Aiming at the defect that quasi critical path algorithm can't take into account both vertical scheduling and horizontal scheduling when scheduling products, this paper proposes an algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device.
The algorithm takes the scheduling scheme formed by the quasi critical path strategy as the basic scheduling scheme, proposes and applies the adjacent parallel processes interchange strategy and the adjacent parallel processes adjustment strategy, generates several new product scheduling schemes, and adds them to the product scheduling scheme set.
Finally, according to the optimal product scheduling scheme selection strategy, the product scheduling scheme with the minimum total processing time is selected as the final scheduling scheme.
The proposed algorithm ensures the compactness of the serial processes, improves the parallel processing of the parallel processes, and optimizes the scheduling results.
Related Results
[RETRACTED] What Is The Bitcoin Aussie System [Update 2022] v1
[RETRACTED] What Is The Bitcoin Aussie System [Update 2022] v1
[RETRACTED]"Bitcoin Aussie System" - Trading has turned into something typical throughout everyday life. Huge number of individuals are making a great many dollars by exchanging di...
Research on Path Smoothing Optimization based on Improved RRT-Connect Algorithm and third-order Bezier curve
Research on Path Smoothing Optimization based on Improved RRT-Connect Algorithm and third-order Bezier curve
Abstract
Targeting the deficiencies of the original RRT-Connect path planning algorithm in dealing with obstacle avoidance, planning efficiency and path smoothing in static...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
IDENTIFIKASI PATH SEBAGAI BAGIAN PENTING PEMBENTUK CITRA KOTA DI KORIDOR JALAN MONDORAKAN KOTAGEDE YOGYAKARTA
IDENTIFIKASI PATH SEBAGAI BAGIAN PENTING PEMBENTUK CITRA KOTA DI KORIDOR JALAN MONDORAKAN KOTAGEDE YOGYAKARTA
Salah satu elemen penting pembentuk citra kota yaitu path dengan tujuan mewujudkan satu kesatuan yang terhubung dan terintegrasi. Penelitian terhadap kualitas Path dapat dibuktikan...
Quasi-semiprime Modules
Quasi-semiprime Modules
Suppose that A be an abelain ring with identity, B be a unitary (left) A-module, in this paper ,we introduce a type of modules ,namely Quasi-semiprime A-module, whenever is a...
QUANTUM DIGITAL-ANALOGUE COMPUTING
QUANTUM DIGITAL-ANALOGUE COMPUTING
Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of...
Data sharing and exchanging with incentive and optimization: a survey
Data sharing and exchanging with incentive and optimization: a survey
AbstractAs the landscape of big data evolves, the paradigm of data sharing and exchanging has gained paramount importance. Nonetheless, the transition to efficient data sharing and...
Characterisation of the treatment provided for children with unilateral hearing loss
Characterisation of the treatment provided for children with unilateral hearing loss
BackgroundChildren with permanent unilateral hearing loss (UHL) are an understudied population, with limited data to inform the guidelines on clinical management. There is a fundin...

