您的检索：
学者姓名：李泉林
精炼检索结果：
年份
成果类型
收录类型
来源
综合
合作者
语言
清除所有精炼条件
摘要 ：
It is interesting and challenging to study double-ended queues with First-Come-First-Match discipline under customers' impatient behavior and non-Poisson inputs. The system stability can be guaranteed by the customers' impatient behavior, while the existence of impatient customers makes analysis of such double-ended queues more difficult or even impossible to find an explicitly analytic solution, thus it becomes more and more important to develop effective numerical methods in a variety of practical matching problems. This paper studies a block-structured double-ended queue, whose block structure comes from two independent Markovian arrival processes (MAPs), which are non-Poisson inputs. We show that such a queue can be expressed as a new bilateral quasi birth-and-death (QBD) process which has its own interest. Based on this, we provide a detailed analysis for both the bilateral QBD process and the double-ended queue, including the system stability, the queue size distributions, the average stationary queue lengths, and the sojourn time of any arriving customers. Furthermore, we develop three effective algorithms for computing the performance measures (i.e., the probabilities of stationary queue lengths, the average stationary queue lengths, and the average sojourn times) of the double-ended queue with non-Poisson inputs. Finally, we use some numerical examples in tabular and graphical to illustrate how the performance measures are influenced by some key system parameters. We believe that the methodology and results described in this paper can be applicable to deal with more general double-ended queues in practice, and develop some effective algorithms for the purpose of many actual uses.
关键词 ：
Impatient customer Impatient customer RG-factorization RG-factorization Phase-type (PH) distribution Phase-type (PH) distribution Double-ended queue Double-ended queue Quasi birth-and-death (QBD) process Quasi birth-and-death (QBD) process Markovian arrival process (MAP) Markovian arrival process (MAP)
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Liu, Heng-Li , Li, Quan-Lin , Chang, Yan-Xia et al. Double-ended queues with non-Poisson inputs and their effective algorithms [J]. | COMPUTERS & OPERATIONS RESEARCH , 2022 , 144 . |
| MLA | Liu, Heng-Li et al. "Double-ended queues with non-Poisson inputs and their effective algorithms" . | COMPUTERS & OPERATIONS RESEARCH 144 (2022) . |
| APA | Liu, Heng-Li , Li, Quan-Lin , Chang, Yan-Xia , Zhang, Chi . Double-ended queues with non-Poisson inputs and their effective algorithms . | COMPUTERS & OPERATIONS RESEARCH , 2022 , 144 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
基于信息收集的降低需求可变性两级供应链博弈研究
关键词 ：
STACKELBERG博弈 STACKELBERG博弈 库存决策 库存决策 需求可变性 需求可变性 信息收集 信息收集 决策科学 决策科学
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | 禹海波 , 李欣 , 李健 et al. 基于信息收集的降低需求可变性两级供应链博弈研究 [J]. | 禹海波 , 2021 , 35 (3) : 229-240 . |
| MLA | 禹海波 et al. "基于信息收集的降低需求可变性两级供应链博弈研究" . | 禹海波 35 . 3 (2021) : 229-240 . |
| APA | 禹海波 , 李欣 , 李健 , 李泉林 , 唐中君 , 管理工程学报 . 基于信息收集的降低需求可变性两级供应链博弈研究 . | 禹海波 , 2021 , 35 (3) , 229-240 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
A Correction to this paper has been published:
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Akbar, Usman , Li, Quan-Lin , Akmal, Muhammad Abdullah et al. Nexus between agro-ecological efficiency and carbon emission transfer: evidence from China (vol 28, pg 18995, 2021) [J]. | ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH , 2021 , 28 (32) : 44581-44581 . |
| MLA | Akbar, Usman et al. "Nexus between agro-ecological efficiency and carbon emission transfer: evidence from China (vol 28, pg 18995, 2021)" . | ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH 28 . 32 (2021) : 44581-44581 . |
| APA | Akbar, Usman , Li, Quan-Lin , Akmal, Muhammad Abdullah , Shakib, Mohammed , Iqbal, Wasim . Nexus between agro-ecological efficiency and carbon emission transfer: evidence from China (vol 28, pg 18995, 2021) . | ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH , 2021 , 28 (32) , 44581-44581 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
This paper proposes a novel mean-field matrix-analytic method in the study of bike sharing systems, in which a Markovian environment is constructed to express time-inhomogeneity and asymmetry of processes that customers rent and return bikes. To achieve effective computability of this mean-field method, this study provides a unified framework through the following three basic steps. The first one is to deal with a major challenge encountered in setting up mean-field block-structured equations in general bike sharing systems. Accordingly, we provide an effective technique to establish a necessary reference system, which is a time-inhomogeneous queue with block structures. The second one is to prove asymptotic independence (or propagation of chaos) in terms of martingale limits. Note that asymptotic independence ensures and supports that we can construct a nonlinear quasi-birth-and-death (QBD) process, such that the stationary probability of problematic stations can be computed under a unified nonlinear QBD framework. Lastly, in the third step, we use some numerical examples to show the effectiveness and computability of the mean-field matrix-analytic method, and also to provide valuable observation of the influence of some key parameters on system performance. We are optimistic that the methodology and results given in this paper are applicable in the study of general large-scale bike sharing systems.
关键词 ：
Markovian environment Markovian environment Nonlinear QBD process Nonlinear QBD process Bike sharing system Bike sharing system Mean-field matrix-analytic method Mean-field matrix-analytic method Time-inhomogeneous queue Time-inhomogeneous queue
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Li, Quan-Lin , Fan, Rui-Na . A mean-field matrix-analytic method for bike sharing systems under Markovian environment [J]. | ANNALS OF OPERATIONS RESEARCH , 2021 , 309 (2) : 517-551 . |
| MLA | Li, Quan-Lin et al. "A mean-field matrix-analytic method for bike sharing systems under Markovian environment" . | ANNALS OF OPERATIONS RESEARCH 309 . 2 (2021) : 517-551 . |
| APA | Li, Quan-Lin , Fan, Rui-Na . A mean-field matrix-analytic method for bike sharing systems under Markovian environment . | ANNALS OF OPERATIONS RESEARCH , 2021 , 309 (2) , 517-551 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
促销和降低需求可变性是企业提高供应链绩效的重要途径.本文针对需求依赖促销努力水平和可变性水平的供应链决策问题,基于概率论中的均值保持变换和均值CVaR准则,研究需求可变性降低和风险偏好对供应链系统的影响.首先,建立供应链集中系统,证明促销努力和降低需求可变性能够增加集中系统的利润.其次,证明降低需求可变性能够增加促销努力,并且使低利润产品的订货量增加而高利润产品的订货量减少.然后,建立零售商风险偏好下的供应链分散系统,证明收益共享与数量折扣组合契约能够协调需求依赖促销努力和可变性水平的供应链.降低需求可变性能增加零售商的最优期望利润,但制造商的最优期望利润是否增加与零售商的风险偏好有关.最后,用数值例子验证了获得的研究结果.
关键词 ：
风险偏好 风险偏好 库存决策 库存决策 决策科学 决策科学 需求可变性 需求可变性 促销努力 促销努力
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | 禹海波 , 付建 , 李健 et al. 需求可变性和风险偏好对需求依赖促销努力供应链的影响 [J]. | 管理工程学报 , 2021 , 35 (4) : 202-215 . |
| MLA | 禹海波 et al. "需求可变性和风险偏好对需求依赖促销努力供应链的影响" . | 管理工程学报 35 . 4 (2021) : 202-215 . |
| APA | 禹海波 , 付建 , 李健 , 李泉林 , 唐中君 . 需求可变性和风险偏好对需求依赖促销努力供应链的影响 . | 管理工程学报 , 2021 , 35 (4) , 202-215 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
如何降低需求可变性,提升供应链绩效是供应链管理中的重要问题之一.针对制造商主导的两层供应链,结合博弈论、概率论与供应链管理理论,提出一种基于均值保持变换的方法,来定量研究通过信息收集降低需求可变性,对供应链成员绩效的影响.首先分析供应链集中决策问题,证明信息收集的努力可增加供应链总利润,并且随着信息收集努力水平的增加,低利润产品的订货量增加而高利润产品的订货量减少;其次建立批发价契约下制造商主导的Stackelberg动态博弈模型,证明零售商收集需求信息对制造商有利,对其自身不利,并且随着信息收集努力水平的增加,低利润产品的订货量和批发价都增加.第三,成本共担的回购契约可同时提升零售商与制造商的利润,并使合作收集需求信息顺利实施.数值例子验证了获得的研究结果.
关键词 ：
需求可变性 需求可变性 信息收集 信息收集 决策科学 决策科学 库存决策 库存决策 Stackelberg博弈 Stackelberg博弈
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | 禹海波 , 李欣 , 李健 et al. 基于信息收集的降低需求可变性两级供应链博弈研究 [J]. | 管理工程学报 , 2021 , 35 (3) : 229-240 . |
| MLA | 禹海波 et al. "基于信息收集的降低需求可变性两级供应链博弈研究" . | 管理工程学报 35 . 3 (2021) : 229-240 . |
| APA | 禹海波 , 李欣 , 李健 , 李泉林 , 唐中君 . 基于信息收集的降低需求可变性两级供应链博弈研究 . | 管理工程学报 , 2021 , 35 (3) , 229-240 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
The dockless bike sharing system (DBSS) has been globally adopted as a sustainable transportation system. Due to the robustness and tractability of the closed queuing network (CQN), it is a well-behaved method to model DBSSs. In this paper, we view DBSSs as CQNs and use the mean value analysis (MVA) algorithm to calculate a small size DBSS and the flow equivalent server (FES) algorithm to calculate the larger size DBSS. This is the first time that the FES algorithm is used to study the DBSS, by which the CQN can be divided into different subnetworks. A parking region and its downlink roads are viewed as a subnetwork, so the computation of CQN is reduced greatly. Based on the computation results of the two algorithms, we propose two optimization functions for determining the optimal fleet size and repositioning flow, respectively. At last, we provide numerical experiments to verify the two algorithms and illustrate the optimal fleet size and repositioning flow. This computation framework can also be used to analyze other on-demand transportation networks.
关键词 ：
closed queuing network closed queuing network dockless bike sharing system dockless bike sharing system flow equivalent server algorithm flow equivalent server algorithm mean value analysis mean value analysis optimization strategy optimization strategy sustainable transportation sustainable transportation
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Fan, Rui-Na , Ma, Fan-Qi , Li, Quan-Lin . Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks [J]. | PROCESSES , 2020 , 8 (3) . |
| MLA | Fan, Rui-Na et al. "Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks" . | PROCESSES 8 . 3 (2020) . |
| APA | Fan, Rui-Na , Ma, Fan-Qi , Li, Quan-Lin . Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks . | PROCESSES , 2020 , 8 (3) . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
In this paper, we develop a more general framework of block-structured Markov processes in the queueing study of blockchain systems, which can provide analysis both for the stationary performance measures and for the sojourn time of any transaction or block. In addition, an original aim of this paper is to generalize the two-stage batch-service queueing model studied in Li et al. (Blockchain queue theory. In: International conference on computational social networks. Springer: New York; 2018. p. 25–40) both “from exponential to phase-type” service times and “from Poisson to MAP” transaction arrivals. Note that the MAP transaction arrivals and the two stages of PH service times make our blockchain queue more suitable to various practical conditions of blockchain systems with crucial factors, for example, the mining processes, the block generations, the blockchain building and so forth. For such a more general blockchain queueing model, we focus on two basic research aspects: (1) using the matrix-geometric solution, we first obtain a sufficient stable condition of the blockchain system. Then, we provide simple expressions for the average stationary number of transactions in the queueing waiting room and the average stationary number of transactions in the block. (2) However, on comparing with Li et al. (2018), analysis of the transaction–confirmation time becomes very difficult and challenging due to the complicated blockchain structure. To overcome the difficulties, we develop a computational technique of the first passage times by means of both the PH distributions of infinite sizes and the RG factorizations. Finally, we hope that the methodology and results given in this paper will open a new avenue to queueing analysis of more general blockchain systems in practice and can motivate a series of promising future research on development of blockchain technologies. © 2019, The Author(s).
关键词 ：
Bitcoin; Block-structured Markov process; Blockchain; Markovian arrival process (MAP); Matrix-geometric solution; Phase type (PH) distribution; RG factorization Bitcoin; Block-structured Markov process; Blockchain; Markovian arrival process (MAP); Matrix-geometric solution; Phase type (PH) distribution; RG factorization
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Li, Q.-L. , Ma, J.-Y. , Chang, Y.-X. et al. Markov processes in blockchain systems [J]. | Computational Social Networks , 2019 , 6 (1) . |
| MLA | Li, Q.-L. et al. "Markov processes in blockchain systems" . | Computational Social Networks 6 . 1 (2019) . |
| APA | Li, Q.-L. , Ma, J.-Y. , Chang, Y.-X. , Ma, F.-Q. , Yu, H.-B. . Markov processes in blockchain systems . | Computational Social Networks , 2019 , 6 (1) . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Supply chain finance (SCF) is an important solution that optimizes cash flow in order to lower financing costs and improve business efficiency especially for small and medium-sized enterprises (SMEs). Risk management is the essential requirement of SCF. In recent years, the digital economy is developing rapidly worldwide and holds huge potential for entrepreneurs and SMEs. In the digital economy scenario, digitalization of supply chains is also becoming increasingly dynamic. Blockchain technology is regarded as a potential means of digitalization for supply chains and could play an important role in supply chain finance risk management. This paper first reviews the literature of supply chain finance risk management and provides some disadvantages of traditional supply chain finance risk management. Then we survey the new perspective for supply chain finance risk management based on blockchain technology. In particular, blockchain can increase the information transparency of the supply chain, thereby reducing the credit risk of SMEs financing and the operational risk in SCF. Categorization and analysis of the literature, it provides an important perspective for future research of supply chain finance risk management based on blockchain technology in the era of digital economy. © Springer Nature Singapore Pte Ltd 2019.
关键词 ：
Blockchain technology; Credit risk; Digital economy; Operational risk; Risk management; Supply chain finance Blockchain technology; Credit risk; Digital economy; Operational risk; Risk management; Supply chain finance
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Li, J. , Wang, Y. , Li, Y. et al. A Simple Survey for Supply Chain Finance Risk Management with Applications of Blockchain [M] //[Li, J., Wang, Y., Li, Y., Li, Q.-L.] 编 Springer Verlag . |
| MLA | Li, J. et al. "A Simple Survey for Supply Chain Finance Risk Management with Applications of Blockchain" [Li, J., Wang, Y., Li, Y., Li, Q.-L.] 编 Springer Verlag . |
| APA | Li, J. , Wang, Y. , Li, Y. , Li, Q.-L. . A Simple Survey for Supply Chain Finance Risk Management with Applications of Blockchain [Li, J., Wang, Y., Li, Y., Li, Q.-L.] 编 Springer Verlag . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Markov decision processes (MDPs) in queues and networks have been an interesting topic in many practical areas since the 1960s. This paper Provides a detailed overview on this topic and tracks the evolution of many basic results. Also, this paper summarizes several interesting directions in the future research. We hope that this overview can shed light to MDPs in queues and networks, and also to their extensive applications in various practical areas. © Springer Nature Singapore Pte Ltd 2019.
关键词 ：
Event-based optimization; Markov Decision processes; Queueing networks; Queueing systems; Sensitivity-based optimization Event-based optimization; Markov Decision processes; Queueing networks; Queueing systems; Sensitivity-based optimization
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Li, Q.-L. , Ma, J.-Y. , Fan, R.-N. et al. An overview for markov decision processes in queues and networks [M] //[Li, Q.-L., Ma, J.-Y., Fan, R.-N., Xia, L.] 编 Springer Verlag . |
| MLA | Li, Q.-L. et al. "An overview for markov decision processes in queues and networks" [Li, Q.-L., Ma, J.-Y., Fan, R.-N., Xia, L.] 编 Springer Verlag . |
| APA | Li, Q.-L. , Ma, J.-Y. , Fan, R.-N. , Xia, L. . An overview for markov decision processes in queues and networks [Li, Q.-L., Ma, J.-Y., Fan, R.-N., Xia, L.] 编 Springer Verlag . |
| 导入链接 | NoteExpress RIS BibTex |
导出
| 数据： |
选中 到 |
| 格式： |
