RAIRO - Operations Research最新文献_第3页

A study on N-policy BMAP/G/1 queueing system 关于 N 政策 BMAP/G/1 排队系统的研究

RAIRO - Operations Research Pub Date : 2024-07-02 DOI: 10.1051/ro/2024135

Bivas Bank, Sujit Kumar Samanta

{"title":"A study on N-policy BMAP/G/1 queueing system","authors":"Bivas Bank, Sujit Kumar Samanta","doi":"10.1051/ro/2024135","DOIUrl":"https://doi.org/10.1051/ro/2024135","url":null,"abstract":"This study presents a simple approach for analyzing the BMAP/G/1 queueing system under N policy. In this policy, the server goes idle at the end of a busy period and the queue length is checked at every arrival moment. The idle server starts serving customers when the queue length reaches or above a predetermined number, namely N, and keeps doing so until the system is completely empty. We first use a simple sequential substitution approach to derive the system length distribution at departure epoch. A comparative study is also conducted to highlight the benefits and strength of our straightforward approach to that of the RG-factorization technique and the roots finding method. We extract the distribution of system length at a random time point by utilizing the remaining service time of a customer who is currently being served as the supplementary variable. The probability density function of the sojourn time distribution for an arbitrary customer of an incoming batch is also computed. We propose an expected linear cost function to estimate the optimal value of N at minimum cost. The validity of our analytic technique has been shown through a variety of numerical examples involving different service time distributions.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"49 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141687820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exploring topological indices of oligothiophene dendrimer via neighbourhood M-polynomial 通过邻域 M 多项式探索低聚噻吩树枝状聚合物的拓扑指数

RAIRO - Operations Research Pub Date : 2024-07-02 DOI: 10.1051/ro/2024138

Muhammad Shafii Abubakar, Kazeem Olalekan Aremu, Prof. Maggie Aphane, Prof. Muhammad Kamran SIDDIQUI

{"title":"Exploring topological indices of oligothiophene dendrimer via neighbourhood M-polynomial","authors":"Muhammad Shafii Abubakar, Kazeem Olalekan Aremu, Prof. Maggie Aphane, Prof. Muhammad Kamran SIDDIQUI","doi":"10.1051/ro/2024138","DOIUrl":"https://doi.org/10.1051/ro/2024138","url":null,"abstract":"In this study, we give some theoretical results for studying the structural connectivity of oligothiophene dendrimer by utilizing the neighborhood M-polynomial. The main result of this article presents the closed formula of neighborhood M-polynomial of oligothiophene dendrimer which is used for computing the neighborhood topological indices of the dendrimer. Among the various indices considered, the forgotten index obtained the highest value, followed by the Sanskruti index, first Zagreb index, and second Zagreb index. These topological indices exhibited an increasing trend as the number of generation increases across the dendrimer structure. Conversely, the remaining index values display minimal or negligible changes as the generation increases. This suggests that these indices exhibits slow increases with higher generations in the dendrimer structure. The significance of adopting the neighborhood M-polynomial to compute the topological index lies in the fact that it facilitates the analysis of complex molecules in a timely manner and allows pendant vertex to contribute more effectively to the overall degree value of the dendrimer. Furthermore, the dataset resulting from these topological indices serves as a foundation for future studies aimed at predicting the physicochemical properties of the dendrimer.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141687217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing Production Planning and Inventory Management in Post-Pandemic Recovery Using A Multi-Period Hybrid Uncertain Optimization Model 利用多期混合不确定优化模型优化大流行后恢复期的生产规划和库存管理

RAIRO - Operations Research Pub Date : 2024-07-02 DOI: 10.1051/ro/2024136

Purnawan Adi Wicaksono, S. Sutrisno, S. Solikhin, A. Aziz

{"title":"Optimizing Production Planning and Inventory Management in Post-Pandemic Recovery Using A Multi-Period Hybrid Uncertain Optimization Model","authors":"Purnawan Adi Wicaksono, S. Sutrisno, S. Solikhin, A. Aziz","doi":"10.1051/ro/2024136","DOIUrl":"https://doi.org/10.1051/ro/2024136","url":null,"abstract":"During the post-COVID-19 pandemic recovery phase, decision-makers in the manufacturing and retail sectors are confronted with numerous uncertainties. These issues comprise various aspects of operations, including the acquisition of raw materials or components and planning production activities. Therefore, this research aimed to introduce an innovative dynamic hybrid optimization model that combined probabilistic and fuzzy techniques. The model would offer a solution for addressing the challenges posed by uncertain parameters, particularly in the context of post-pandemic scenarios for production planning and inventory management with multiple periods of observation. The model was designed to handle exceptional circumstances such as parameter uncertainties, augmented demand fluctuations, fuzzy variables, and probabilistic factors. The primary objective of the model was to maximize the expected total profit of the operational process. To achieve this aim, an uncertain programming algorithm based on the interior point method was used to compute the optimal decision for the problem at hand. Through the execution of simulations using randomly generated data, the proposed model was thoroughly evaluated and analyzed with six suppliers, three raw part types, three product types, and six periods. All six suppliers were selected to supply raw parts, however, not all suppliers were selected to supply particular raw part types. Furthermore, it was derived that the expectation of the maximum profit is 897261.40; this is the best expected profit generated by the optimization model, meaning that other decisions may result in a smaller expectation of the profit. The results of these simulations unequivocally showed the effectiveness of the decision-making model in providing optimal solutions, specifically in terms of raw material procurement and production planning strategies. Subsequently, this model could serve as a valuable tool for decision-makers operating within the manufacturing and retail industries.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"18 17","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141686019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robustness of prefabricated construction supply chain network against underload cascading failure 预制建筑供应链网络对欠载级联故障的稳健性

RAIRO - Operations Research Pub Date : 2024-06-14 DOI: 10.1051/ro/2024127

Qiang Du, Shasha Li, Yani Zhang, Yerong Zhang

{"title":"Robustness of prefabricated construction supply chain network against underload cascading failure","authors":"Qiang Du, Shasha Li, Yani Zhang, Yerong Zhang","doi":"10.1051/ro/2024127","DOIUrl":"https://doi.org/10.1051/ro/2024127","url":null,"abstract":"A prefabricated construction supply chain(PCSC) is a complex network with high interdependency between entities. After disturbance, it is prone to cascading failure, leading to project delays or budget overruns. Therefore, it is necessary to model a robust network against cascading failure to achieve a sustainable prefabricated construction system. This study explores the functional robustness of a prefabricated construction supply chain network (PCSCN) against underload cascading failure. First, the PCSCN is constructed as a three-echelon supply chain network based on complex network theory, which can characterize the general characteristics of PCSC and provide the network foundation for the subsequent numerical simulation research. Then, a more realistic underload cascading failure model that adds the new element of substitute nodes is established to describe load loss propagation in the PCSCN. Finally, the Order Fulfillment Rate(OFR) is used as the robustness index to quantify network robustness from a functional perspective. The numerical simulation results indicate that in the PCSCN, the larger the initial load is, the more important the node, and component manufacturers are more important than building material suppliers. In addition, the node capacity upper bound parameter α has a positive relationship with robustness, the failure coefficient β has a negative relationship, and the edge weight adjustment coefficient θ has no significant impact on robustness. This research can provide guidance for developing cascade control and defense strategies in PCSCN risk management.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141343617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Social welfare maximization of tourist bus service system in the M/M/1 queue with strategic tourists 有战略游客的 M/M/1 队列中旅游巴士服务系统的社会福利最大化

RAIRO - Operations Research Pub Date : 2024-06-14 DOI: 10.1051/ro/2024129

Nidhi Nidhi, Sudeep Singh Sanga

{"title":"Social welfare maximization of tourist bus service system in the M/M/1 queue with strategic tourists","authors":"Nidhi Nidhi, Sudeep Singh Sanga","doi":"10.1051/ro/2024129","DOIUrl":"https://doi.org/10.1051/ro/2024129","url":null,"abstract":"Tourism is experiencing a transformative phase in its development, playing a pivotal role in\u0000the country’s economic growth. The potential for further advancement lies in effective tourism\u0000management. Recognizing this vital aspect, the present study investigates the application of the\u0000M/M/1 queueing model, considering the strategic behavior of tourists in a tourist bus service\u0000(TBS) system. A TBS system involves the provision of bus services to tourists, ensuring convenient\u0000and efficient travel to various destinations. Understanding the phenomenon of balking\u0000as a strategic behavior of tourists is crucial, where tourists strategically decide whether to join\u0000or balk based on the queue length, thereby highlighting its impact on the dynamics of tourists’\u0000decision-making. In the proposed model, our attention is directed toward understanding the\u0000equilibrium and socially optimal strategies adopted by incoming tourists through a reward-cost\u0000structure in the observable queue. This structure allows us to analyze and identify the most effective\u0000and efficient strategies for tourists based on the balance between the rewards they receive\u0000and the costs they incur. Furthermore, government strategies involve interventions and policies\u0000by authorities to regulate and optimize the functioning of the TBS system. These strategies\u0000may include the implementation of subsidies or taxes on buses aimed at influencing bus arrival\u0000rates. We examine how governmental strategies are employed to identify the optimal bus buffer\u0000size objectively, ultimately seeking to maximize social welfare in the TBS system. Through a\u0000series of numerical experiments, we aim to unravel the dynamics of the optimal strategies while\u0000assessing the impact of varying information levels and TBS system parameters on the overall\u0000societal benefit. The ultimate objective is to pave the way for an optimized and more beneficial\u0000tourism landscape, fostering positive outcomes in the tourism sector.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"5 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141343743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A spectral condition for component factors in graphs 图中分量因子的光谱条件

RAIRO - Operations Research Pub Date : 2024-06-13 DOI: 10.1051/ro/2024126

Sufang Wang, Wei Zhang

引用次数: 0

Parallel implementation of an exact two-phase method for the bi-objective knapsack problem 并行实施双目标 Knapsack 问题的精确两阶段法

RAIRO - Operations Research Pub Date : 2024-06-13 DOI: 10.1051/ro/2024125

Khadidja Chaabane, Sadek Bouroubi, Younes Djellouli

引用次数: 0

Research on pricing strategies for competitive green supply chain based on corporate social responsibility 基于企业社会责任的竞争性绿色供应链定价策略研究

RAIRO - Operations Research Pub Date : 2024-06-06 DOI: 10.1051/ro/2024124

Longhui Liu, Chengfeng Wu, Qiuhong Zhao, Longxin Wang

{"title":"Research on pricing strategies for competitive green supply chain based on corporate social responsibility","authors":"Longhui Liu, Chengfeng Wu, Qiuhong Zhao, Longxin Wang","doi":"10.1051/ro/2024124","DOIUrl":"https://doi.org/10.1051/ro/2024124","url":null,"abstract":"With the increasing public awareness of environmental protection, corporate social responsibility has become an important component of sustainable development and competitive advantage for many enterprises. Although there are many studies on corporate social responsibility in the supply chain, there is still a lack of research on the impact of corporate social responsibility on various decision-makers in the competitive green supply chain dominated by upstream enterprises. Therefore, taking into account the greenness and corporate social responsibility, the paper proposes three Stackelberg game models with the two-echelon supply chain consisting of two competing manufacturers and one socially responsible retailer. We develop a series of propositions and corollaries to determine the optimal solutions and offer some managerial insights. The main novelties and contributions of the paper can be demonstrated in two aspects. First, the paper simultaneously considers the impact of competition intensity and CSR level on wholesale prices, retail prices and greenness level. Second, the paper discusses the impact of two manufacturers with different market positions investing in green products on the profits and utility of supply chain members. Numerical illustrations prove that the level of corporate social responsibility is negatively correlated with retailer profitability and the retailer achieve the highest profits when sub-dominant manufacturer produces green products.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"115 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An extension of locating-total domination problem and its complexity 定位总支配问题的扩展及其复杂性

RAIRO - Operations Research Pub Date : 2024-06-06 DOI: 10.1051/ro/2024123

E. N, Dr. JAYAGOPAL R

{"title":"An extension of locating-total domination problem and its complexity","authors":"E. N, Dr. JAYAGOPAL R","doi":"10.1051/ro/2024123","DOIUrl":"https://doi.org/10.1051/ro/2024123","url":null,"abstract":"An $r$-dominating set ($r$-total dominating set) of $G$ is a subset $S$ of $V(G)$ for which $N_{r}^{}(u)cap S$ is non-empty for all $u$ not in $S$ (for all $u$ in $V(G)$).\u0000 \u0000% \u0000 \u0000 \u0000An $r$-locating-dominating set ($r$-locating-total dominating set) of $G$ is an $r$-dominating set ($r$-total dominating set) $S$ of $G$ for which $N_{r}^{}(u)cap S$ is different from $N_{r}^{}(v) cap S$ for all $u$ and $v$ not in $S$. \u0000 \u0000 \u0000%An $r$-dominating set ($r$-total dominating set) $S$ in a graph $G$ is called an $r$-locating-dominating set ($r$-locating-total dominating set) if for all $u$ and $v$ in $V(G) setminus S$, $N_{r}^{}(u)cap S$ is different from $N_{r}^{}(v) cap S$. \u0000 \u0000 \u0000% \u0000 \u0000 \u0000This paper presents an extension of the locating-total dominating set of $G$. \u0000 \u0000 \u0000%In this paper, we present an extension of locating-total dominating set of $G$ that we refer to as the $r$-locating-total dominating set of $G$. \u0000 \u0000 \u0000Further, we establish a lower bound on $r$-locating-dominating set and $r$-locating-total dominating set for $k$-regular graphs, as well as demonstrate that $r$-locating-total dominating set is an NP-complete problem. \u0000 \u0000 \u0000Furthermore, the $r$-locating-dominating set and $r$-locating-total dominating set problems are discussed for some standard graphs.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"56 s192","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141376504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Online reviews and spillover effects in the dual-channel supply chain: A choice strategy of sales format 双渠道供应链中的在线评论和溢出效应：销售形式的选择策略

RAIRO - Operations Research Pub Date : 2024-06-05 DOI: 10.1051/ro/2024122

Tian‐Hui You, Chun-Yi Liu, Bingbing Cao

引用次数: 0