The Customer's Perspective on Waiting Time in Electronic Marketing

2011 ◽  
Vol 39 (8) ◽  
pp. 1053-1062 ◽  
Author(s):  
Hung-Yuan Lin ◽  
Ting-Yueh Chang

From the perspective of range theory we explored whether or not consumer evaluation of waiting time depends on a comparison between the actual waiting time and the expected range of waiting time that is specified in the marketing communication. A 2 × 2 between-subjects design was employed, and evaluation of waiting time served as a critical dependent variable. Results indicated that consumers' evaluation of waiting time was significantly different when they were advised of different ranges of waiting time guarantee. For the condition of 3-7 days of waiting time guarantee, participants' evaluation of waiting time was significantly favorable because the actual number of waiting days was less than the maximum of 7 in the guarantee.

2001 ◽  
Vol 120 (5) ◽  
pp. A370-A370
Author(s):  
C BOBROWSKI ◽  
H GHADIMPOOR ◽  
M STENECK ◽  
X ROGIERS ◽  
C BROELSCH ◽  
...  
Keyword(s):  

Optimization ◽  
1973 ◽  
Vol 4 (6) ◽  
pp. 453-462
Author(s):  
L. Cunningham ◽  
N. Singh

2014 ◽  
Author(s):  
A.M.L. Westin ◽  
C.L. Barksdale ◽  
S.H. Stephan

Nature ◽  
2010 ◽  
Author(s):  
Apoorva Mandavilli
Keyword(s):  

Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


Sign in / Sign up

Export Citation Format

Share Document