Journal of Applied Mathematics and Computing最新文献_第3页

Single machine scheduling with generalized due-dates, learning effect, and job-rejection 具有广义到期日、学习效应和作业拒绝的单机调度

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-06 DOI: 10.1007/s12190-024-02198-x

Baruch Mor, Doron Mor, Noamya Shani, Dana Shapira

{"title":"Single machine scheduling with generalized due-dates, learning effect, and job-rejection","authors":"Baruch Mor, Doron Mor, Noamya Shani, Dana Shapira","doi":"10.1007/s12190-024-02198-x","DOIUrl":"https://doi.org/10.1007/s12190-024-02198-x","url":null,"abstract":"We study single-machine scheduling problems with Generalized due-dates (GDD), learning effect, and optional job rejection. For the GDD setting, the due dates are assigned to the jobs according to their position in the sequence rather than their identity. Thus, assuming that due dates are numbered in non-decreasing order, the jth due date refers to the job assigned to the jth position. The learning effect is a model where completing former jobs decreases the completion time of latter jobs. The processing time is still part of the input, depending on how many jobs have already been scheduled. Allowing the option of job rejection means that not all jobs must be processed. In this case, the scheduler is penalized for each rejected job, and an input parameter bounds the total rejection cost. Two objective functions are considered with the above-mentioned settings: minimizing total tardiness and minimizing maximal tardiness. The problems are polynomially solvable when there is no option for job rejection. Otherwise, both are shown to be NP-hard, pseudo-polynomial dynamic programming solutions are proposed, and numerical experiments are provided.","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"91 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The structural properties of fuzzy median graphs 模糊中值图的结构特性

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-06 DOI: 10.1007/s12190-024-02197-y

Anandhu Mohan, M. V. Dhanyamol, Sunil Mathew

引用次数: 0

A stochastic rumor spreading model with event-triggered discontinuous feedback control in multilingual online networks 多语言在线网络中带有事件触发非连续反馈控制的随机谣言传播模型

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-05 DOI: 10.1007/s12190-024-02184-3

Yang Xia, Haijun Jiang

{"title":"A stochastic rumor spreading model with event-triggered discontinuous feedback control in multilingual online networks","authors":"Yang Xia, Haijun Jiang","doi":"10.1007/s12190-024-02184-3","DOIUrl":"https://doi.org/10.1007/s12190-024-02184-3","url":null,"abstract":"Benefiting from the development of Internet technology, online social networks with multilingual communication function are in a booming stage, greatly contributing to the convenience, extensiveness and diversity of information exchange. To explore the rumor diffusion mechanism and efficient control strategies in multilingual online environments, a novel stochastic rumor-spreading model with the generalized nonlinear diffusion form is proposed. Firstly, we strictly prove the positive and existence uniqueness of the model solution to ensure that it corresponds to the realistic meaning. Then, the asymptotic behavior around the rumor-free equilibrium is acquired by using graph theorey and stochastic stability theory. Besides, we obtain conditions for the stationary distribution of stochastic rumor-spreading model based on the Kasminskii’s theory. Moreover, an event-triggered discontinuous feedback (ETDF) control strategy that can be applied to online networks is proposed, which initiates control only when an alert threshold is exceeded and updates the control intensity when an event-triggered condition is reached. Finally, numerical simulations verify the correctness of the theoretical results, and an actual multilingual Internet rumor case shows the applicability of the model.","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"1 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On metric dimension of carbon nanotube Y-junctions 关于碳纳米管 Y 型连接的度量尺寸

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-05 DOI: 10.1007/s12190-024-02208-y

Muhammad Faisal Nadeem, Ayesha Shabbir, Muhammad Azeem

{"title":"On metric dimension of carbon nanotube Y-junctions","authors":"Muhammad Faisal Nadeem, Ayesha Shabbir, Muhammad Azeem","doi":"10.1007/s12190-024-02208-y","DOIUrl":"https://doi.org/10.1007/s12190-024-02208-y","url":null,"abstract":"Carbon nanotube Y-shaped junctions (normally called as Y-junctions) are constructed by inserting heptagons into the graphene sheet. The design requires the inclusion of at least 6 heptagons at the junction where 3 carbon nanotubes joined. With the growing focus on carbon nanotubes, their junctions have garnered increased attention for their applications in various scientific fields. Chemical structures can be expressed in graphs, where atoms represent vertices, and the bonds between the atoms are called edges. To obtain the exact position of an atom, which is unique from all the atoms, several atoms are selected, this is called resolving set. The minimum number of atoms in the resolving set is called the metric dimension. In this paper, we have computed the metric dimension of carbon nanotube Y-junctions, assigning each atom a unique identifier to facilitate precise location. The metric dimension is constant for all the values of the 3 parameters included to develop a Y-junction. It resulted in 3 metric dimensions for the entire Y-junction. It means that whatever the order and quantity of nanotubes attached to it, the metric dimension will remain constant with number 3.\u0000","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"7 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy 结合粗糙集理论和标记策略，从无权有向图中寻找单源最短路径

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-03 DOI: 10.1007/s12190-024-02201-5

Taihua Xu, Mingfeng Hua, Xibei Yang, Yun Cui, Fei Wang, Shuai Li

{"title":"Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy","authors":"Taihua Xu, Mingfeng Hua, Xibei Yang, Yun Cui, Fei Wang, Shuai Li","doi":"10.1007/s12190-024-02201-5","DOIUrl":"https://doi.org/10.1007/s12190-024-02201-5","url":null,"abstract":"As a classical concept of graph theory, single-source shortest paths (SSSPs) plays a crucial role in numerous practical applications. Presently, the time complexity of existing SSSPs algorithms is at least ({O}(m + nlogn)). Therefore, it is still significant to design SSSPs algorithms with higher computational efficiency. In our former works, the efficiency of computing strongly connected components (SCCs) has enhanced through utilizing rough sets theory (RST). Thus, this paper also attempts to compute SSSPs more efficiently based on RST. Firstly, the graph concept of SSSPs is analyzed in the framework of RST, to provide the theoretical basis of computing SSSPs through RST method. Secondly, k-step R-related set (one RST operator) is utilized for traversing those vertices which are reachable from the source vertex. Thirdly, a marking strategy is introduced to narrow the search scope of SSSPs, which can further promote the efficiency of computing SSSPs. Finally, based on RST and marking strategy, an algorithm named 3SP@RM is put forward for finding SSSPs of unweighted directed graphs. The comparative experiment is conducted over 14 datasets. Related results display that 3SP@RM algorithm can correctly compute SSSPs of unweighted directed graphs, and the efficiency of 3SP@RM algorithm exceeds that of two existing similar methods. Even the larger scale of dataset is, more efficiency advantage 3SP@RM algorithm has.","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"26 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141887159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A sixth order kernel functions approach for nonlinear fourth order boundary value problems 非线性四阶边界值问题的六阶核函数方法

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-03 DOI: 10.1007/s12190-024-02210-4

F. Z. Geng, C. N. Li, X. Y. Wu

引用次数: 0

Ordering blockchain technology for multinational companies based on Yager aggregation operators under bipolar fuzzy information 基于双极模糊信息下雅格聚合算子的跨国公司区块链技术排序

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-02 DOI: 10.1007/s12190-024-02181-6

Ubaid ur Rehman, Tahir Mahmood

{"title":"Ordering blockchain technology for multinational companies based on Yager aggregation operators under bipolar fuzzy information","authors":"Ubaid ur Rehman, Tahir Mahmood","doi":"10.1007/s12190-024-02181-6","DOIUrl":"https://doi.org/10.1007/s12190-024-02181-6","url":null,"abstract":"Blockchain technology is a digital ledger technology that is used to store and manage data in a decentralized and secure way. It is essentially a database that is distributed across a network of computers, and every block of data is connected to the prior block, forming a chain of blocks (hence the name \"blockchain\"). Blockchain technology can transform the way multinational companies operate, enabling them to operate more efficiently, securely, and transparently in a globalized business environment. The selection of the best and finest blockchain technology for any multinational company is not an easy task. Thus, in this script, we generate primary operations relying on Yager t-norm and t-conorm for bipolar fuzzy information and then generate aggregation operators under bipolar fuzzy information such as bipolar fuzzy Yager weighted averaging, bipolar fuzzy Yager ordered weighted averaging, bipolar fuzzy Yager weighted geometric and bipolar fuzzy Yager ordered weighted geometric operators based on initiated operations. Moreover, we generate an approach to decision-making by employing the generated operators to tackle real-life decision-making dilemmas. Afterward, we initiate a case study i.e., ordering blockchain technology for Multinational companies. Towards the end of this script, to reveal the superior qualities and benefits of the generated work, we conduct a comparative analysis between the current and generated work.","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"15 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141884067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs 求解广义线性乘法编程程序的输出空间分支和边界缩减算法

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-08-02 DOI: 10.1007/s12190-024-02202-4

Suxia Ma, Yuelin Gao, Bo Zhang

引用次数: 0

On analysis of a system of non-homogenous boundary value problems using hausdorff derivative with exponential kernel 论利用指数核豪斯多夫导数分析非均质边界值问题系统

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-07-31 DOI: 10.1007/s12190-024-02199-w

Shafi Ullah, Kamal Shah, Muhammad Sarwar, Manel Hleili, Arshad Ali, Thabet Abdeljawad

引用次数: 0

Existence of fixed points results via new enriched type of nonexpansive maps and application to delay differential equations 通过新的增强型非展开映射的定点存在结果及其在延迟微分方程中的应用

IF 2.2 3区数学

Journal of Applied Mathematics and Computing Pub Date : 2024-07-31 DOI: 10.1007/s12190-024-02162-9

R. Sri Bharathi, Ashis Bera

引用次数: 0