Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Golshan Madraki has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Unraveling the dynamics of urban desirability: a multi-faceted analysis of large cities

    by Yasamin Salmani, Amin Ariannezhad, Golshan Madraki


  • Politicians, Pundits, and Platform Migration: A Comparison of Political Polarization on Parler and Twitter

    by University of Wisconsin-Madison, Abigial Matthews, Jacqueline M. Otala, Clarkson University, Esma Wali, Gillian Kurtic, Lynden Millington, Michael Simpson, Jeanna Matthews, Golshan Madraki

    Parler, a self-proclaimed free speech social media platform founded in 2018, attracted a large influx of new members in 2020 as the result of a highly visible platform migration campaign. Parler usage was linked to the planning of the Jan. 6, 2021 attack on the United States Capitol building, leading to a shutdown of the Parler platform. Parler, which is now back online, offers an important lens through which to examine the broader attempts at platform migration in response to changing content moderation and platform governance policies and their impact on political polarization. We begin by examining the network connections between US Congressional Representatives on both Twitter and Parler. We find that Parler has a homogenous population of users, consisting of a single isolated group, where polarization seems irrelevant, while Twitter demonstrates two clearly polarized groups. We compare how politicians and political pundits use Parler differently. Finally, we examine the evolution of Parler including comparing Parler’s own policies before and after the shutdown and reflecting on the future of platforms like Parler and similar platform migration experiments.


  • Open Access

    Politicians, Pundits, and Platform Migration: A Comparison of Political Polarization on Parler and Twitter

    by University of Wisconsin-Madison, Abigial Matthews, Jacqueline M. Otala, Clarkson University, Esma Wali, Gillian Kurtic, Lynden Millington, Michael Simpson, Jeanna Matthews, Golshan Madraki

    Parler, a self-proclaimed free speech social media platform founded in 2018, attracted a large influx of new members in 2020 as the result of a highly visible platform migration campaign. Parler usage was linked to the planning of the Jan. 6, 2021 attack on the United States Capitol building, leading to a shutdown of the Parler platform. Parler, which is now back online, offers an important lens through which to examine the broader attempts at platform migration in response to changing content moderation and platform governance policies and their impact on political polarization. We begin by examining the network connections between US Congressional Representatives on both Twitter and Parler. We find that Parler has a homogenous population of users, consisting of a single isolated group, where polarization seems irrelevant, while Twitter demonstrates two clearly polarized groups. We compare how politicians and political pundits use Parler differently. Finally, we examine the evolution of Parler including comparing Parler’s own policies before and after the shutdown and reflecting on the future of platforms like Parler and similar platform migration experiments.


  • A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs

    by Golshan Madraki, Seyedamirabbas Mousavian, Yasamin Salmani

    Job-shop scheduling problems are complex and still well-studied manufacturing problems. Improvement heuristic algorithms have been proposed to solve the scheduling problems using makespan as their performance measure. All these heuristics iteratively perturb trial schedules by selecting a new schedule from a set of nearby schedules (neighbourhood); then, recalculate and compare the makespan until a sufficient schedule is determined. Unlike previous studies, we did not generate a new heuristic or a novel neighbourhood calculation. Instead, we proposed a theoretical framework, Algorithm to Visit Affected Node (AVAN), which can be incorporated in qualified heuristics while using their current neighbourhood structure to accelerate the recalculation of the makespan in each iteration. We modelled the system by Directed Acyclic Graph (DAG) where the length of the longest path equals the makespan. The scheduling perturbations are represented by adding and deleting edges. AVAN investigates the configuration of scheduling perturbations (added/deleted edges) to find an appropriate starting point to traverse the graph. AVAN is mathematically more efficient than previous longest path algorithms for perturbed DAG. Its time complexity is O(Δ+|Δ|log⁡(|Δ|)), where |Δ| is the number of affected nodes and Δ is the number of incoming and outgoing edges of the affected nodes.


  • Strategic Supplier Selection in Payment Industry: A Multi-Criteria Solution for Insufficient and Interrelated Data Sources

    by Siavash Hekmat, Maghsoud Amiri, Golshan Madraki

    Our goal is to address the complicated problem of strategic supplier selection with interrelated and insufficient data. To achieve this goal, we proposed our Strategic Supplier Selection Methodology (SSSM). First, SSSM formulates the enterprise strategies and evaluation criteria. Then, we developed a novel method called Grey Principal Component Analysis-Data Envelopment Analysis (GPCA-DEA) to evaluate suppliers in SSSM. GPCA-DEA overcomes the major disadvantages and limitations of former methodologies (e.g., DEA) while dealing with insufficient and interrelated data. Finally, SSSM applies Multiple Attribute Decision-Making (MADM) methods to select suppliers based on the ranking score. The application of SSSM is illustrated in the payment industry to select Payment Initiation Service Providers (PISP). For the first time, we considered the payment industry-specific criteria in compliance with the latest regulation (PSD2). The Spearman rank correlation statistical test showed that our method (GPCA-DEA used in SSSM) yields more reliable results than a former version of DEA.


  • Open Access

    Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

    by Jacqueline Otala, Alden Minard, Golshan Madraki, Seyedamirabbas Mousavian

    Graphs are powerful tools to model manufacturing systems and scheduling problems. The complexity of these systems and their scheduling problems has been substantially increased by the ongoing technological development. Thus, it is essential to generate sustainable graph-based modeling approaches to deal with these excessive complexities. Graphs employ nodes and edges to represent the relationships between jobs, machines, operations, etc. Despite the significant volume of publications applying graphs to shop scheduling problems, the literature lacks a comprehensive survey study. We proposed the first comprehensive review paper which (1) systematically studies the overview and the perspective of this field, (2) highlights the gaps and potential hotspots of the literature, and (3) suggests future research directions towards sustainable graphs modeling the new intelligent/complex systems. We carefully examined 143 peer-reviewed journal papers published from 2015 to 2020. About 70% of our dataset were published in top-ranked journals which confirms the validity of our data and can imply the importance of this field. After discussing our generic data collection methodology, we proposed categorizations over the properties of the scheduling problems and their solutions. Then, we discussed our novel categorization over the variety of graphs modeling scheduling problems. Finally, as the most important contribution, we generated a creative graph-based model from scratch to represent the gaps and hotspots of the literature accompanied with statistical analysis on our dataset. Our analysis showed a significant attention towards job shop systems (56%) and Un/Directed Graphs (52%) where edges can be either directed, or undirected, or both, Whereas 14% of our dataset applied only Undirected Graphs and 11% targeted hybrid systems, e.g., mixed shop, flexible, and cellular manufacturing systems, which shows potential future research directions.


  • Open Access

    Characterizing and Comparing COVID-19 Misinformation Across Languages, Countries and Platforms

    by Golshan Madraki, Isabella Grasso, Jacqueline Otala, Yu Liu, Jeanna Matthews

    Misinformation/disinformation about COVID-19 has been rampant on social media around the world. In this study, we investigate COVID-19 misinformation/ disinformation on social media in multiple languages - Farsi (Persian), Chinese, and English, about multiple countries - Iran, China, and the United States (US), and on multiple platforms such as Twitter, Facebook, Instagram, Weibo, and WhatsApp. Misinformation, especially about a global pandemic, is a global problem yet it is common for studies of COVID-19 misinformation on social media to focus on a single language, like English, a single country, like the US, or a single platform, like Twitter. We utilized opportunistic sampling to compile 200 specific items of viral and yet debunked misinformation across these languages, countries and platforms emerged between January 1 and August 31. We then categorized this collection based both on the topics of the misinformation and the underlying roots of that misinformation. Our multi-cultural and multilingual team observed that the nature of COVID-19 misinformation on social media varied in substantial ways across different languages/countries depending on the cultures, beliefs/religions, popularity of social media, types of platforms, freedom of speech and the power of people versus governments. We observe that politics is at the root of most of the collected misinformation across all three languages in this dataset. We further observe the different impact of government restrictions on platforms and platform restrictions on content in Iran, China, and the US and their impact on a key question of our age: how do we control misinformation without silencing the voices we need to hold governments accountable?

  • Efficient algorithm to find makespan in manufacturing systems under multiple scheduling perturbations

    by Golshan Madraki, Robert P. Judd

    Manufacturing scheduling improvement heuristics iterate over trial schedules to determine a satisfactory schedule. During each iteration, a performance measure (e.g. makespan) is calculated. The paper presents an efficient algorithm, Structural Perturbation Algorithm (SPA), that accelerates the calculation of the makespan. This means all scheduling improvement heuristics using SPA to calculate makespan for each trial schedule will run faster. To achieve this goal, the manufacturing system is modelled by a Directed Acyclic Graph (DAG). Schedule trials can be described as a perturbed DAG where multiple edges are added and deleted. The major contribution of this research is that SPA can handle multiple edge deletions/additions with a single pass which makes it more efficient in terms of time complexity than current approaches. SPA accomplishes this by partitioning the nodes into three regions based on the locations of the added and deleted edges. Then, SPA updates the length of the affected nodes in each region. The application of SPA is not limited to the scheduling problem. The SPA can be applied in other fields as long as the problem can be described as a Perturbed DAG.