Query：
学者姓名：李泉林
Refining：
Year
Type
Indexed by
Source
Complex
Co-Author
Language
Clean All
Abstract ：
Queues or waiting lines are a common phenomenon in healthcare facilities. The increasing number of admissions to hospital emergency departments (EDs) has resulted in overcrowded EDs and decreased quality of care. Patients may renege with dissatisfaction while waiting, prolonged hospital stays, or the cancelation of surgeries, especially for those with acute diseases. This paper studies patient admission and queuing control policies, considering premature discharge decisions and reneging behavior. First, we formulate this problem as an infinite-horizon total discounted cost Markov decision process to balance bed utility and experiences of patients waiting for admission to minimize the total expected cost for the hospital. Then, we characterize an optimal admission threshold policy by analyzing the structural properties of the optimal value function. Numerical experiments are employed to discuss how the optimal dynamic policy depends on some key parameters of the system. Finally, the performance of the optimal policy is discussed through comparison with the benchmark: A myopic rule (first come, first served) mimicking the decision-making in practice under different scenarios. The numerical results show that the reneging behavior can affect the superiority of the optimal policy compared to the benchmark, and the optimal policy can significantly reduce the number of waiting patients without increasing the total expected cost when the system is overloaded.
Keyword ：
reneging behavior reneging behavior premature discharge premature discharge admission and discharge decisions admission and discharge decisions OR in healthcare OR in healthcare Markov decision process Markov decision process
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Feifei , Li, Quan-Lin , Zhang, Chi et al. Optimal admission and queuing control with reneging behavior under premature discharge decisions [J]. | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH , 2023 , 32 (1) : 502-529 . |
| MLA | Yang, Feifei et al. "Optimal admission and queuing control with reneging behavior under premature discharge decisions" . | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 32 . 1 (2023) : 502-529 . |
| APA | Yang, Feifei , Li, Quan-Lin , Zhang, Chi , Wang, Chengliang . Optimal admission and queuing control with reneging behavior under premature discharge decisions . | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH , 2023 , 32 (1) , 502-529 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
This paper discusses a large-scale dockless bike-sharing system (DBSS) with unusable bikes, which can be removed, repaired, redistributed and reused under two batch policies: one for removing the unusable bikes from each parking region to a maintenance shop, and the other for redistributing the repaired bikes from the maintenance shop to some suitable parking regions. For such a bike-sharing system, this paper proposes and develops a new computational method by applying the RG-factorizations of block-structured Markov processes to the closed queueing networks. Different from previous works in the literature of queueing networks, a key contribution of our computational method is to set up a new nonlinear matrix equation to determine the relative arrival rates, and to show that the nonlinearity comes from two different groups of processes: The failure and removing processes, and the repair and redistribution processes. Once the relative arrival rate is introduced to each node, these nodes are isolated from each other so that the Markov processes of all the nodes are independent of each other, and thus the Markov system of each node is described as an elegant block-structured Markov process whose stationary probabilities can be easily computed by the RG-factorizations. Based on this, the paper establishes a more general product-form solution of the closed queueing network, and provides performance analysis of the DBSS through a comprehensive discussion of the bikes' failure, removing, repair, redistribution and reuse processes under two batch policies. We hope that our method opens a new avenue for quantitative evaluation of more general DBSSs with unusable bikes.
Keyword ：
Closed queueing network Closed queueing network RG-factorization RG-factorization Dockless bike-sharing system Dockless bike-sharing system Unusable bikes Unusable bikes Performance evaluation Performance evaluation Block-structured Markov process Block-structured Markov process
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fan, Rui-Na , Li, Quan-Lin , Wu, Xiaole et al. Dockless bike-sharing systems with unusable bikes: removing, repair and redistribution under batch policies [J]. | ANNALS OF OPERATIONS RESEARCH , 2022 . |
| MLA | Fan, Rui-Na et al. "Dockless bike-sharing systems with unusable bikes: removing, repair and redistribution under batch policies" . | ANNALS OF OPERATIONS RESEARCH (2022) . |
| APA | Fan, Rui-Na , Li, Quan-Lin , Wu, Xiaole , Zhang, Zhe George . Dockless bike-sharing systems with unusable bikes: removing, repair and redistribution under batch policies . | ANNALS OF OPERATIONS RESEARCH , 2022 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
The practical Byzantine fault tolerant (PBFT) consensus mechanism is one of the most basic consensus algorithms (or protocols) in blockchain technologies. Thus its performance evaluation is an interesting and challenging topic due to the higher complexity of its consensus work in a peer-to-peer network. This study describes a simple stochastic performance model of the PBFT consensus mechanism. This model is refined not only as a queuing system with complicated service times but also as a level-independent quasi-birth-and-death (QBD) process. With regard to the level-independent QBD process, we apply the matrix-geometric solution to obtain the necessary and sufficient condition under which the PBFT consensus system is stable and then numerically compute the stationary probability vector of the QBD process. Thus, we provide four useful performance measures for the PBFT consensus mechanism, and we can numerically calculate these performance measures. Finally, we use numerical examples to verify the validity of our theoretical results and demonstrate how the four performance measures are influenced by certain key parameters of the PBFT consensus. Considering theory of multi-dimensional Markov processes, we are optimistic that the methodology and results presented in this study are applicable to a wide range of PBFT consensus mechanism and even other types of consensus mechanisms.
Keyword ：
Matrix-geometric solution Matrix-geometric solution Practical Byzantine fault tolerant (PBFT) Practical Byzantine fault tolerant (PBFT) Quasi-birth-and-death (QBD) process Quasi-birth-and-death (QBD) process Performance evaluation Performance evaluation Blockchain Blockchain Consensus mechanism Consensus mechanism
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ma, Fan-Qi , Li, Quan-Lin , Liu, Yi-Han et al. Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain [J]. | PEER-TO-PEER NETWORKING AND APPLICATIONS , 2022 , 15 (6) : 2516-2528 . |
| MLA | Ma, Fan-Qi et al. "Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain" . | PEER-TO-PEER NETWORKING AND APPLICATIONS 15 . 6 (2022) : 2516-2528 . |
| APA | Ma, Fan-Qi , Li, Quan-Lin , Liu, Yi-Han , Chang, Yan-Xia . Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain . | PEER-TO-PEER NETWORKING AND APPLICATIONS , 2022 , 15 (6) , 2516-2528 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
In this paper, we apply a Markov decision process to find the optimal asynchronous dynamic policy of an energy-efficient data center with two server groups. Servers in Group 1 always work, while servers in Group 2 may either work or sleep, and a fast setup process occurs when the server's states are changed from sleep to work. The servers in Group 1 are faster and cheaper than those of Group 2 so that Group 1 has a higher service priority. Putting each server in Group 2 to sleep can reduce system costs and energy consumption, but it must bear setup costs and transfer costs. For such a data center, an asynchronous dynamic policy is designed as two sub-policies: The setup policy and the sleep policy, both of which determine the switch rule between the work and sleep states for each server in Group 2. To find the optimal asynchronous dynamic policy, we apply the sensitivity-based optimization to establish a block-structured policy-based Markov process and use a block-structured policy-based Poisson equation to compute the unique solution of the performance potential by means of the RG-factorization. Based on this, we can characterize the monotonicity and optimality of the long-run average profit of the data center with respect to the asynchronous dynamic policy under different service prices. Furthermore, we prove that a bang-bang control is always optimal for this optimization problem. We hope that the methodology and results developed in this paper can shed light on the study of more general energy-efficient data centers.
Keyword ：
Markov decision process Markov decision process RG-factorization RG-factorization asynchronous dynamic policy asynchronous dynamic policy sensitivity-based optimization sensitivity-based optimization energy-efficient data center energy-efficient data center
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ma, Jing-Yu , Li, Quan-Lin , Xia, Li . Optimal Asynchronous Dynamic Policies in Energy-Efficient Data Centers [J]. | SYSTEMS , 2022 , 10 (2) . |
| MLA | Ma, Jing-Yu et al. "Optimal Asynchronous Dynamic Policies in Energy-Efficient Data Centers" . | SYSTEMS 10 . 2 (2022) . |
| APA | Ma, Jing-Yu , Li, Quan-Lin , Xia, Li . Optimal Asynchronous Dynamic Policies in Energy-Efficient Data Centers . | SYSTEMS , 2022 , 10 (2) . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
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.
Keyword ：
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)
Cite：
Copy from the list or Export to your reference management。
| 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 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
The security and fairness of blockchain are always threatened by selfish mining attacks. To study such selfish mining attacks, some necessary and useful methods need to be developed sufficiently. In this paper, we provide an interesting method for analyzing dynamic decision of blockchain selfish mining by applying the sensitivity-based optimization. Our goal is to find the optimal dynamic blockchain-pegged mining policy of the dishonest mining pool. To this end, we consider a blockchain system with two mining pools: the honest and the dishonest mining pools, where the honest mining pool follows a two-block leading competitive criterion, while the dishonest mining pool follows a modification of two-block leading competitive criterion. To find the optimal blockchain-pegged mining policy, we develop the sensitivity-based optimization to study dynamic decision of blockchain system through setting up a policy-based Poisson equation, and provide an expression for the unique solution of performance potentials. Based on this, we can characterize monotonicity and optimality of the long-run average profit with respect to the blockchain-pegged mining reward. Also, we prove the structure of the optimal blockchain-pegged mining policy. The methodology and results derived in this paper significantly reduce the large search space of finding the optimal policy, thus they can shed light on the optimal dynamic decision research on the selfish mining attacks of blockchain systems.
Keyword ：
Blockchain Blockchain Selfish mining Selfish mining Markov decision process Markov decision process Sensitivity-based optimization Sensitivity-based optimization Blockchain-pegged mining policy Blockchain-pegged mining policy
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ma, Jing-Yu , Li, Quan-Lin . Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2022 , 44 (5) : 3663-3700 . |
| MLA | Ma, Jing-Yu et al. "Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 44 . 5 (2022) : 3663-3700 . |
| APA | Ma, Jing-Yu , Li, Quan-Lin . Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2022 , 44 (5) , 3663-3700 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
基于信息收集的降低需求可变性两级供应链博弈研究
Keyword ：
STACKELBERG博弈 STACKELBERG博弈 库存决策 库存决策 需求可变性 需求可变性 信息收集 信息收集 决策科学 决策科学
Cite：
Copy from the list or Export to your reference management。
| 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 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
A Correction to this paper has been published:
Cite：
Copy from the list or Export to your reference management。
| 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 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
We study a dynamic job assignment problem in queueing systems with one class of Poisson arrivals and K groups of heterogeneous servers. A scheduling policy prescribes the job assignment among servers in each group at every state n (number of jobs in the system). Our goal is to obtain the optimal policy to minimize the long-run average cost, which involves the increasingly convex holding cost for jobs and the operating cost for working servers. This problem has wide application scenarios in operations management, such as job scheduling in manufacturing systems, packet routing in communication systems, and staffing in service systems. We prove that the optimal policy has monotone structures and quasi bang-bang control forms. Specifically, we discover that the optimal policy is governed by the marginal cost rate c - mu G(n), where c is the operating cost rate, mu is the service rate, and G(n) is called the perturbation realization factor at state n. Under the condition of scale economies which can be guaranteed by any increasingly concave operating cost in mu, we prove that the optimal policy obeys a so-called c/mu-rule: Servers with a smaller c/mu should be occupied by jobs with higher priority. Optimality of multi-threshold type policies is further proved when the c/mu-rule is applied. Our c/mu-rule in group-server queues can be viewed as a counterpart of the famous c mu-rule in polling queues, which both significantly reduce the complexity of optimization problems. By utilizing these optimality structures, we also develop computational-efficient algorithms to determine the optimal policy numerically. Simulation experiments demonstrate the good scalability and robustness of the c/mu-rule, which are important for managerial practice.
Keyword ：
group-server queue group-server queue resource allocation resource allocation sensitivity-based optimization sensitivity-based optimization c/mu-rule c/mu-rule job assignment job assignment
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Xia, Li , Zhang, Zhe George , Li, Quan-Lin . A c/mu-Rule for Job Assignment in Heterogeneous Group-Server Queues [J]. | PRODUCTION AND OPERATIONS MANAGEMENT , 2021 , 31 (3) : 1191-1215 . |
| MLA | Xia, Li et al. "A c/mu-Rule for Job Assignment in Heterogeneous Group-Server Queues" . | PRODUCTION AND OPERATIONS MANAGEMENT 31 . 3 (2021) : 1191-1215 . |
| APA | Xia, Li , Zhang, Zhe George , Li, Quan-Lin . A c/mu-Rule for Job Assignment in Heterogeneous Group-Server Queues . | PRODUCTION AND OPERATIONS MANAGEMENT , 2021 , 31 (3) , 1191-1215 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
促销和降低需求可变性是企业提高供应链绩效的重要途径.本文针对需求依赖促销努力水平和可变性水平的供应链决策问题,基于概率论中的均值保持变换和均值CVaR准则,研究需求可变性降低和风险偏好对供应链系统的影响.首先,建立供应链集中系统,证明促销努力和降低需求可变性能够增加集中系统的利润.其次,证明降低需求可变性能够增加促销努力,并且使低利润产品的订货量增加而高利润产品的订货量减少.然后,建立零售商风险偏好下的供应链分散系统,证明收益共享与数量折扣组合契约能够协调需求依赖促销努力和可变性水平的供应链.降低需求可变性能增加零售商的最优期望利润,但制造商的最优期望利润是否增加与零售商的风险偏好有关.最后,用数值例子验证了获得的研究结果.
Keyword ：
风险偏好 风险偏好 库存决策 库存决策 决策科学 决策科学 需求可变性 需求可变性 促销努力 促销努力
Cite：
Copy from the list or Export to your reference management。
| 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 . |
| Export to | NoteExpress RIS BibTex |
Export
| Results： |
Selected to |
| Format： |
