Allocation Policies to Fulfil Heterogeneous Service Requirements under Resource Pooling

2020 ◽  
Author(s):  
Babak Abbasi ◽  
Masih Fadaki ◽  
Zahra Hosseinifard ◽  
Hamed Jahani ◽  
Douglas J. Thomas
Keyword(s):  
Resource Pooling ◽  
Heterogeneous Service

Hierarchical Optimization of Network Resource for Heterogeneous Service in Cloud Scenarios

2018 ◽  
pp. -1--1
Author(s):  
Dong Huang ◽  
Yong Bai ◽  
Jingcheng Liu ◽  
Hongtao Chen ◽  
Jinghua Lin ◽  
...  
Keyword(s):  
Hierarchical Optimization ◽  
Network Resource ◽  
Heterogeneous Service

A swift response tool for measuring the strategic fit for resource pooling: a case study

2007 ◽  
Vol 45 (3) ◽  
pp. 434-449 ◽  
Author(s):  
Kobe Naesens ◽  
Ludo Gelders ◽  
Liliane Pintelon
Keyword(s):  
Resource Pooling ◽  
Strategic Fit

scholarly journals Complete resource pooling of a load-balancing policy for a network of battery swapping stations

2021 ◽  
Author(s):  
Fiona Sloothaak ◽  
James Cruise ◽  
Seva Shneer ◽  
Maria Vlasiou ◽  
Bert Zwart
Keyword(s):  
Carbon Emission ◽  
Queueing Network ◽  
Service Levels ◽  
Resource Pooling ◽  
Transportation Sector ◽  
Single Station ◽  
Optimal Resource ◽  
Promising Solution ◽  
Reduce Carbon Emission

AbstractTo reduce carbon emission in the transportation sector, there is currently a steady move taking place to an electrified transportation system. This brings about various issues for which a promising solution involves the construction and operation of a battery swapping infrastructure rather than in-vehicle charging of batteries. In this paper, we study a closed Markovian queueing network that allows for spare batteries under a dynamic arrival policy. We propose a provisioning rule for the capacity levels and show that these lead to near-optimal resource utilization, while guaranteeing good quality-of-service levels for electric vehicle users. Key in the derivations is to prove a state-space collapse result, which in turn implies that performance levels are as good as if there would have been a single station with an aggregated number of resources, thus achieving complete resource pooling.

scholarly journals Auction models with resource pooling in modern supply chain management

2019 ◽  
Vol 1 (2) ◽  
pp. 120-134
Author(s):  
Lihua Chen ◽  
Liying Wang ◽  
Yingjie Lan
Keyword(s):  
Supply Chain ◽  
Supply Chain Management ◽  
Incentive Compatibility ◽  
Supply And Demand ◽  
Vickrey Auction ◽  
Chain Management ◽  
Content Type ◽  
Resource Pooling ◽  
Auction Models ◽  
Auction Model

Purpose In this paper, the main focus is on supply and demand auction systems with resource pooling in modern supply chain from a theoretical modeling perspective. The supply and demand auction systems in modern supply chains among manufacturers and suppliers serve as information sharing mechanisms. The purpose of this paper is to match the supply and demand such that a modern supply chain can achieve incentive compatibility and economic efficiency. The authors design such a supply and demand auction system that can integrate resources to efficiently match the supply and demand. Design/methodology/approach The authors propose three theoretic models of modern supply chain auctions with resource pooling according to the Vickrey auction principle. They are supply auction model with demand resource pooling, demand auction model with supply resource pooling, and double auction model with demand and supply resource pooling. For the proposed auction models, the authors present three corresponding algorithms to allocate resources in the auction process by linear programming, and study the incentive compatibility and define the Walrasian equilibriums for the proposed auction models. The authors show that the solutions of the proposed algorithms are Walrasian equilibriums. Findings By introducing the auction mechanism, the authors aim to realize the following three functions. First is price mining: auction is an open mechanism with multiple participants. Everyone has his own utility and purchasing ability. So, the final price reflects the market value of the auction. Second is dynamic modern supply chain construction: through auction, firm can find appropriate partner efficiently. Third is resources integration: in business practices, especially in modern supply chain auctions, auctioneers can integrate resources and ally buyers or sellers to gain more efficiency in auctions. Originality/value In the paper, the authors propose three theoretic models and corresponding algorithms of modern supply chain auctions with resource pooling according using the Vickrey auction principle, which achieves three functions: price mining, dynamic modern supply chain construction and resources integrating. Besides, these proposed models are much closer to practical settings and may have potential applications in modern supply chain management.

scholarly journals Pathwise optimality of the exponential scheduling rule for wireless channels

2004 ◽  
Vol 36 (04) ◽  
pp. 1021-1045 ◽  
Author(s):  
Sanjay Shakkottai ◽  
R. Srikant ◽  
Alexander L. Stolyar
Keyword(s):  
Queue Length ◽  
Wireless Channels ◽  
Unique Feature ◽  
Heavy Traffic ◽  
Wireless Channel ◽  
Service Rate ◽  
Resource Pooling ◽  
Scheduling Policy ◽  
Multiple Data ◽  
Heavy Traffic Limit

We consider the problem of scheduling the transmissions of multiple data users (flows) sharing the same wireless channel (server). The unique feature of this problem is the fact that the capacity (service rate) of the channel varies randomly with time and asynchronously for different users. We study a scheduling policy called the exponential scheduling rule, which was introduced in an earlier paper. Given a system withNusers, and any set of positive numbers {an},n= 1, 2,…,N, we show that in a heavy-traffic limit, under a nonrestrictive ‘complete resource pooling’ condition, this algorithm has the property that, for each timet, it (asymptotically) minimizes maxnanq̃n(t), whereq̃n(t) is the queue length of usernin the heavy-traffic regime.

scholarly journals M^x/G/1FEEDBACK QUEUE WITH THREE STAGE HETEROGENEOUS SERVICE, MULTIPLE ADAPTIVE VACATION AND CLOSED DOWN TIMES

10.26524/krj4 ◽  
2014 ◽  
Vol 1 (1) ◽  
pp. 11-22
Author(s):  
Ganesh Sivakumar J ◽  
Ramesh kumar E ◽  
Nithyananthan A
Keyword(s):  
Heterogeneous Service
Sign in / Sign up

Export Citation Format

Share Document