Maximum Number Of Customers Research Articles

Variations Between Physical Banking and Internet Banking Usage amid COVID-19 Pandemic

The usage of banking functions through Internet is comfortable and time saving process, since the usage rates of different banking functions through Internet banking mechanism are very low. The present study aims to evaluate the variations between physical banking and internet banking and explores the problems faced by banking customers in using internet banking amid the COVID-19 pandemic. The primary data for the present study were collected from banking customers, who were identified on a random basis from three different areas of the Union Territory of Jammu and Kashmir. The total sample size was 1,200, comprising a breakup of 400 for each of the sampling areas of central Kashmir, south Kashmir and north Kashmir. Internet banking adoption is changing the physical usage of non-financial products and financial products worldwide. Today, a click of the mouse and mobile banking offer a lot of transactions regarding electronic non-financial products and electronic financial products. Still, the adoption rates of these products are very low. The present study has examined the situation of electronic banking adoption amid the COVID-19 pandemic, and hence, it is found that maximum number of customers are non-users of electronic non-financial products and electronic financial products. Amid the pandemic, the reason for non-usage of technology banking by a majority of customers was lack of awareness, technological barriers and security concerns. They also used physical banking activities and did not follow social distancing as suggested by the Government of India during March 2020. Therefore, it is the basic responsibility of the banking industry to motivate their customers and address their concerns regarding the usage of electronic non-financial products and electronic financial products, as the maximum number of banking customers are non-users of electronic non-financial products and electronic financial products. If the banking industry will address the concerns of banking customers regarding the usage of technology banking, then only a country like India with a huge population can have technological banking and environment-friendly banking and can face situations like the COVID-19 pandemic in future.

New Challenges on Waiting Lines and Servicescapes During the Covid-19 Pandemic

The organisational constraints imposed on servicescapes during the Covid have had dramatic consequences for both retailers and consumers. On the one hand, the need to reduce congestion imposed new regulations, such as the “maximum number of customers per store,” had a significant impact on the length, duration, and location of queues. On the other hand, the fear of the contagion has changed the way we appropriate physical spaces. Customers respond to adverse conditions abandoning or avoiding the queue when situations and other customers’ behaviours do not match their expectations. Behaviours appear to be directly related to objective and perceived risk.

STRATEGY OF DIGITALIZATION OF RUSSIAN BANKING PRODUCTS IN SOCIAL NETWORKS IN THE CONTEXT OF A PANDEMIC

In the article, the author explores the digital technologies used by Russian banks in the creation and promotion of financial products (goods and services) in social networks. First of all, we study the introduction of media technologies in the creation and broadcasting of banking services and products using social media, the main of which are social networks. Systemic and statistical methods were used for a comprehensive disclosure of the problem, which made it possible to classify approaches to the problem, as well as a method of structuring information, which makes it possible to identify the main tools for the specifics of the functioning of the banking system in the context of new media. Analysts are exploring the format of functioning in the modern market through social networks that allow expanding digital banking. Analysis of the activities of the banking sector, the introduction of innovations in the activities of the banking sector allow us to determine the trend of attracting the maximum number of customers. The study identifies incentives for the development of the banking system in the context of the new realities associated with the pandemic. The expansion of the production of new banking services through their digitalization is determined by long-term strategies for the development of financial institutions in three types of innovative areas. New services and products of banks broadcast through social networks were identified. The transformation of banking services is characterized. Thus, the analysis of statistical data of digital content and analytical data allows us to determine the innovative potential of payment systems that have proven themselves in the world community and practice.

Effectiveness of Visual Merchandising on Consumer Buying Behaviour: A Study of Reliance Digital, Puttur, DK

Purpose: In this networked world, the buyer's purchase decisions are influenced by the arrangement and presentation of items in the store. Nowadays, the furniture and furnishing types have become more viable in the retail industry. Many new businesses are entering into the organized format of retail in this category. Hence the retailers need to differentiate themselves from each other. As the products are similar, it is necessary to differentiate themselves by presenting them with visual merchandising. Objective: The core objective of this work is to study the influence of visual merchandising on consumer purchase patterns based on store attributes. Another objective of this study is to know the dimensions which influence the purchase behavior or decision of the consumers, Design/Methodology/Approach: For this analysis, we have considered many online sources, namely websites and blogs, which guide and review display merchandising. Percentages, charts, diagrams are being used to present the tabular data. Findings/Result: It is found that variables like store appearance, lighting, music, window display, mannequins, and price tags have an impact on the purchase choice of consumers, as per the changing need of consumer the retailer should always try to maximize the quantity of new merchandising relating to the trend. The store must adopt a congenial store atmosphere to attract a maximum number of customers and retain them in their business for long. Originality/Value: Through the help of primary and secondary data, the study revealed that male youngster customers are more frequently visiting the store. The study reveals that the seating arrangement inside the store is not sufficient. The majority of the customer is visiting Reliance Digital to buy some specific product. Spot purchase activities are happening very rarely. Paper Type: Visual Merchandising on Consumer buying behaviour at Reliance Digital is a case study analysis work.

Online Resource Allocation Under Partially Predictable Demand

Real-Time Resource Allocation: Beyond Stochastic Demand Modeling

Optimal Feeder Routing in Urban Distribution Networks Planning with Layout Constraints and Losses

We address the problem of optimally re-routing the feeders of urban distribution network in Milano, Italy, which presents some peculiarities and significant design challenges. Milano has two separate medium-voltage (MV) distribution networks, previously operated by two different utilities, which grew up independently and incoordinately. This results in a system layout which is inefficient, redundant, and difficult to manage due to different operating procedures. The current utility UNARETI, which is in charge of the overall distribution system, aims at optimally integrating the two MV distribution networks and moving to a new specific layout that offers advantages from the perspectives of reliability and flexibility. We present a mixed-integer programming (MIP) approach for the design of a new network configuration satisfying the so-called 2-step ladder layout required by the planner. The model accounts for the main electrical constraints such as power flow equations, thermal limits of high-voltage (HV)/MV substation transformers, line thermal limits, and the maximum number of customers per feeder. Real power losses are taken into account via a quadratic formulation and a piecewise linear approximation. Computational tests on a small-scale system and on a part of the Milano distribution network are reported.

Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution

We present and solve a rich vehicle routing problem based on a practical distribution problem faced by a third-party logistics provider, whose aim is to deliver pharmaceutical products to healthcare facilities in Tuscany. The problem is characterized by having multiple depots, a heterogeneous fleet of vehicles, flexible time windows, periodic demands, incompatibilities between vehicles and customers, a maximum duration for the routes, and a maximum number of customers per route. A multi-start iterated local search algorithm making use of several neighborhoods is proposed to solve the problem. The algorithm has been tested on a large number of instances and obtained good results, both on the real case study and on a number of artificially generated instances.

Package Placement Application Based on Location Tracking on Android Platform

JNE has a pickup service program to pick up a package of loyal online shop customers. This system still has limitations in terms of interaction with customers and JNE customer service. This causes less than the maximum number of customers or partners to get better service. Based on these problems starting with the manufacture of input-output design with the tracking location method will facilitate customers in the package pick-up process. This research will produce a package pickup application on the Android platform that is created using the Java programming language and uses the MySQL database so that JNE can do its business activities in a shorter and timely manner. With the use of this application can cause process time savings reaching package pick-up more efficiently, this application can be a better substitute for the previous system.

A STUDY ON CONSUMER BEHAVIOR TOWARDS AYURVEDIC PRODUCTS IN AHMEDABAD CITY

Indian is a country where Ayurveda born. And expend its goodwill across the globe. Earlier Ayurveda was been used in India to cure illness and disease. As time changed, the business environment became more competitive for companies because of heavy competition in the market. Every Ayurvedic company wants to maximize the market share and want to have a maximum number of customers. In such a scenario, customers select Ayurvedic companies’ product very carefully and by analysis various aspect of marketing strategies. Current research work is an attempt to understand customers’ behavior towards the OTC Ayurvedic products in Ahmedabad city. For this, researchers have collected data through questionnaire and interpret it. Data findings elaborate on the various aspect of consumer Behavior towards Ayurvedic Products.

Online Resource Allocation Under Partially Predictable Demand

For online resource allocation problems, we propose a new demand arrival model where the sequence of arrivals contains both an adversarial component and a stochastic one. Our model requires no demand forecasting; however, due to the presence of the stochastic component, we can partially predict future demand as the sequence of arrivals unfolds. Under the proposed model, we study the problem of the online allocation of a single resource to two types of customers, and design online algorithms that outperform existing ones. Our algorithms are adjustable to the relative size of the stochastic component, and our analysis reveals that as the portion of the stochastic component grows, the loss due to making online decisions decreases. This highlights the value of (even partial) predictability in online resource allocation. We impose no conditions on how the resource capacity scales with the maximum number of customers. However, we show that using an adaptive algorithm — which makes online decisions based on observed data — is particularly beneficial when capacity scales linearly with the number of customers. Our work serves as a first step in bridging the long-standing gap between the two well-studied approaches to the design and analysis of online algorithms based on (1) adversarial models and (2) stochastic ones. Using novel algorithm design, we demonstrate that even if the arrival sequence contains an adversarial component, we can take advantage of the limited information that the data reveals to improve allocation decisions. We also study the classical secretary problem under our proposed arrival model, and we show that randomizing over multiple stopping rules may increase the probability of success.

Finding optimal region for bichromatic reverse nearest neighbor in two- and three-dimensional spaces

The MaxBRNN problem is to find an optimal region such that setting up a new service within this region might attract the maximum number of customers by proximity. The MaxBRNN problem has many practical applications such as service location planning and emergency schedule. In typical real-life applications the data volume of the problem is huge, thus an efficient solution is highly desired. In this paper, we propose two efficient algorithms, namely, OptRegion, and 3D-OptRegion to tackle the MaxBRNN problem and MaxBRkNN in two- and three-dimensional spaces, especially for the 3D-OptRegion, we propose a powerful pruning strategy Fine-grained Pruning Strategy to reduce the searching space. Our method employs three optimization techniques, i.e., sweep line (sweep plane in a three-dimensional space), pruning strategy (based on upper bound estimation), and influence value computation (of candidate points), to improve the search performance. In a three-dimensional space, we additionally use a fine-grained pruning strategy to further improve the pruning effect. Extensive experimental evaluation using both real and synthetic datasets confirms that both OptRegion and 3D-OptRegion outperform the existing algorithms significantly under all problem instances.

Role of Information Technology in the Development of Banking Sector in India

Liberalization and Information technology has attracted many foreign banks to India, thereby opening up new markets, new products and efficient delivery channels for the banking industry. In the development of Indian Economy, Banking sector plays a very important and crucial role. With the use of technology there had been an increase in penetration, productivity and efficiency. It has not only increased the cost effectiveness but also has helped in making small value transactions viable. It also enhances choices, creates new markets, and improves productivity and efficiency. It has been noticed that financial markets have turned into a buyer’s markets in India. Commercial Banks in India are now becoming a one-stop Supermarket. The focus is shifting from mass banking to class banking with the introduction of value added and customized products. Technology allows banks to create what looks like a branch in a business building’s lobby without having to hire manpower for manual operations. The branches are running on the concept of 24 X 7 working, made possible by the use of Tele banking, ATMs, Internet banking, Mobile banking and E - banking. These technology driven delivery channels are being used to reach out to maximum number of customers at lower cost and in most efficient manner. The beauty of these banking innovations is that it puts both banker and customer in a win- win situation. Effective use of technology has a multiplier effect on growth and development.

The Single Server Queue with Catastrophes and Geometric Reneging

We consider the single server queue with catastrophes that occur according to a Poisson process. The catastrophes force all present customers to abandon the system and render the server inoperative. Then a repair time is set on till the server becomes ready to serve again the customers. In the meanwhile the customers are accumulated according to their arrival process. Recently, several authors have investigated the reneging behavior in such systems and other related models when the customers become impatient because of the failure of the server. Two kinds of reneging have been considered: independent and binomial. In the case of independent reneging, each customer has its own patience time and abandons the system as soon as it expires. In the case of binomial reneging, the abandonment opportunities occur according to a certain point process and then all present customers decide simultaneously but independently whether they will abandon the system or not. In the present paper, we complement these studies by considering the case of geometric reneging. This case arises when the abandonment opportunities occur according to a certain point process and the customers decide sequentially whether they will leave the system or not. We derive explicit expressions and computational schemes for various performance descriptors, concerning the number of customers in system, the sojourn time of a customer, the duration and the maximum number of customers in a busy period.

Statistical Queuing Theory with Some Applications

An overview of theory of queues, single node and in network, is presented in this paper. In addition some applications are outlined. Some very well-known and others more uncommon.

The single server vacation queueing model with geometric abandonments

Several recent papers have investigated the customer reneging behavior in queueing systems with vacations, where the customers become impatient during the absence of the server(s). These studies have treated the cases of independent and synchronized abandonments. In the case of independent abandonments, the customers have their own independent patience times and abandon the system when such times expire. In the case of synchronized abandonments, the abandonment opportunities occur according to a certain point process and then all present customers decide simultaneously but independently whether they will abandon the system or not. In the present paper, we complement these studies by considering the case of geometric abandonments. This case arises when the abandonment opportunities occur according to a certain point process and the customers decide sequentially whether they will leave the system or not. We derive explicit expressions and computational schemes for various performance descriptors, including the number of customers in system, the sojourn time of a customer, the duration and the maximum number of customers in a busy period.

Algorithmic analysis of theMAP/PH/1 retrial queue

In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.

Optimal control of an M/M/2 queueing system with finite capacity operating under the triadic (0,Q,N,M) policy

operating under the triadic (0,Q, N,M) policy, where L is the maximum number of customers in the system. The number of working servers can be adjusted one at a time at arrival epochs or at service completion epochs depending on the number of customers in the system. Analytic closed-form solutions of the controllable M/M/2 queueing system with finite capacity operating under the triadic (0,Q, N,M) policy are derived. This is a generalization of the ordinary M/M/2 and the controllable M/M/1 queueing systems in the literature. The total expected cost function per unit time is developed to obtain the optimal operating (0,Q, N,M) policy at minimum cost.

Optimal control of batch service queues with finite service capacity and linear holding costs

We consider the optimal control problem of certain batch service queueing systems with compound Poisson arrivals and linear holding costs. The control problem involves the determination of the epochs at which the service is initiated as well as the sizes of the batches served. The service times are assumed to be independent and identically distributed, however, with a general distribution. A quite natural operating policy is to start the service as soon as the number of customers reaches some threshold and serve always as many customers as possible. Assuming infinite service capacity Deb [4] proved that under some mild conditions the optimal operating policy is of this type. In this paper we show that a similar result is valid even if the service capacity is finite. In this case the threshold is never greater than Q, the service capacity (the maximum number of customers that can be served at the same time).

Packet switch engineering procedures when customer characteristics are uncertain

A method for packet-switch provisioning which accounts for the effects of uncertainty in estimating customer characteristics is demonstrated. The method models the traffic parameters of the customers as random variables. It is used to calculate the maximum number of customers that can be accommodated while controlling the probability that their traffic control is beyond the nominal capacity of the system. It is shown that, depending on the degree of uncertainty in estimating parameters for the arrival process, the application of the method can have a substantial impact on the provisioning of the switch. Examples in which the effects of uncertainty on engineering are quantified are given. >

待ち行列問題の連続モデルを利用する近似解法II : 複数窓口有限待ち行列

An approximation method based on the diffusion theory is proposed for solving multi-server finite queueing problems having general independent inter-arrival time and general service time distributions. The discrete customer flow through the system is approximated by a continuous one, and a diffusion equation for the process of the number of customers in the system is constructed by using means and variances of the inter-arrival time and service time distributions. Two reflecting boundaries are imposed at the origin and m, the maximum number of customers being allowed in the system. Later, the boundary conditions are modified to improve the approximation. Approximate formulas for P_n. Probability of finding n customers in the system, and for N, mean number of lost customers from the system per mean service time, are given for steady state. Numerical examples for mean number of customers in the system are presented for some E_l/E_k/s(m) systems to show the effectiveness of the proposed method.