Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Ohio University / OhioLINK
2017
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501838878410153 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-ohiou1501838878410153 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-ohiou15018388784101532021-08-03T07:03:46Z Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations Madraki, Golshan Industrial Engineering Computer Science Algorithm Directed Acyclic Graph The Longest Path Structural Perturbation Scheduling Problem Directed Acyclic Graphs (DAGs) are used to model different types of systems such as manufacturing systems, database systems, and pricing systems, compilers and communication networks. As systems evolves, changes can occur in the structure of the DAG representing a system, i.e. edges can be deleted or added. Due to these structural perturbations, nodes can be affected which means the value of the performance measures of the DAG will change. The main contribution of this research is an efficient algorithm called Structural Perturbation Algorithm (SPA) that updates the performance measures of affected nodes and topologically sorts nodes in a perturbed DAG where multiple edges are added and deleted with a single pass. The time complexity of the SPA is O(|E_a^b |+ |E_a^b | log|E_a^b |+||Δ_P⋃ N_Q|| + |Δ_P ⋃ N_Q |+|Δ_P | log|Δ_P |), where E_a^b is a set of backward added edges; N_Q is the minimum set of nodes whose topological sort is violated by the backward added edges; if the remaining nodes are in set N_P then Δ_P is the set of affected nodes in N_P. |X| denotes the number of members in set X and ||X|| denotes the number of edges that begin or terminate on the nodes in set X. Also, the weights of nodes can be zero or positive. An interesting application of the SPA is to enhance improvement heuristics for the manufacturing scheduling problem in manufacturing systems by accelerating the calculation of performance measures in each iteration. This work uses this application as an example of applying the SPA. Several modifications to the SPA are discussed. The first modification shows that the SPA can be made more efficient when the weights of nodes are all positive (no zero weights). The second modifications allows the SPA to handle vectors weights instead of scalars to calculate other performance measures beside the longest path. Finally, it is shown that the SPA can be terminated early if performance measure cannot improve 2017-09-19 English text Ohio University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501838878410153 http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501838878410153 restricted--full text unavailable until 2022-09-01 This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Industrial Engineering Computer Science Algorithm Directed Acyclic Graph The Longest Path Structural Perturbation Scheduling Problem |
| spellingShingle |
Industrial Engineering Computer Science Algorithm Directed Acyclic Graph The Longest Path Structural Perturbation Scheduling Problem Madraki, Golshan Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| author |
Madraki, Golshan |
| author_facet |
Madraki, Golshan |
| author_sort |
Madraki, Golshan |
| title |
Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| title_short |
Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| title_full |
Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| title_fullStr |
Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| title_full_unstemmed |
Efficient Algorithm to Find Performance Measures in Systems under Structural Perturbations |
| title_sort |
efficient algorithm to find performance measures in systems under structural perturbations |
| publisher |
Ohio University / OhioLINK |
| publishDate |
2017 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501838878410153 |
| work_keys_str_mv |
AT madrakigolshan efficientalgorithmtofindperformancemeasuresinsystemsunderstructuralperturbations |
| _version_ |
1719452752733536256 |