scholarly journals Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

2017 ◽  
Author(s):  
Satyasundara Mahapatra ◽  
Rati Ranjan Dash ◽  
Sateesh K. Pradhan
Keyword(s):  
Waiting Time ◽  
Scheduling Problems ◽  
Time Variance ◽  
Waiting Time Variance

An Evolutionary Hybrid Scheduling Algorithm for Computational Grids

2008 ◽  
Vol 12 (5) ◽  
pp. 479-484 ◽  
Author(s):  
Shajulin Benedict ◽  
◽  
Rejitha R. S ◽  
V. Vasudevan ◽  
Keyword(s):  
Simulated Annealing ◽  
Waiting Time ◽  
Resource Discovery ◽  
Computational Grids ◽  
Scheduling Problems ◽  
Distributed Resources ◽  
Grid Scheduling ◽  
Hybrid Scheduling ◽  
Time Variance ◽  
Waiting Time Variance

Grids promote user collaboration through flexible, coordinated sharing of distributed resources to solve a single large problem. Grid scheduling, similar to resource discovery and monitoring, is inherently more complex in Grid environments. We propose two approaches for solving Grid scheduling problems with the simultaneous objectives of maximizing the number of workflow executions and minimizing the waiting time variance among tasks of each workflow. One is the multiple objective Niched Pareto Genetic Algorithm (NPGA) that involves evolution during a comprehensive search and work on multiple solutions. After the Genetic search, we strengthen the search using Simulated Annealing as a local search meta-heuristic. For comparison, we evaluate other scheduling, such as, Tabu Search (TS), Simulated annealing (SA), and Discrete Particle Swarm Optimization (Discrete PSO). Results show that our proposed evolutionary Hybrid scheduling involving NPGA with an SA search, works better than other scheduling in considering workflow execution time within a deadline and waiting time variance in tasks with minimal iterations.

Job scheduling to minimize the weighted waiting time variance of jobs

2007 ◽  
Vol 52 (1) ◽  
pp. 41-56 ◽  
Author(s):  
Xueping Li ◽  
Nong Ye ◽  
Tieming Liu ◽  
Yang Sun
Keyword(s):  
Waiting Time ◽  
Job Scheduling ◽  
Time Variance ◽  
Waiting Time Variance

Simultaneous minimization of total tardiness and waiting time variance on a single machine by genetic algorithms

2014 ◽  
Vol 72 (1-4) ◽  
pp. 439-446 ◽  
Author(s):  
Maghsoud Amiri ◽  
Laya Olfat ◽  
Mehdi Keshavarz Ghorabaee
Keyword(s):  
Genetic Algorithms ◽  
Waiting Time ◽  
Single Machine ◽  
Total Tardiness ◽  
Time Variance ◽  
Waiting Time Variance

Minimizing weighted waiting time variance on a single processor

2011 ◽  
Vol 61 (4) ◽  
pp. 1233-1239 ◽  
Author(s):  
Xiaoyun Xu
Keyword(s):  
Waiting Time ◽  
Time Variance ◽  
Waiting Time Variance ◽  
Single Processor

Job scheduling methods for reducing waiting time variance

2007 ◽  
Vol 34 (10) ◽  
pp. 3069-3083 ◽  
Author(s):  
Nong Ye ◽  
Xueping Li ◽  
Toni Farley ◽  
Xiaoyun Xu
Keyword(s):  
Waiting Time ◽  
Job Scheduling ◽  
Time Variance ◽  
Waiting Time Variance

Minimising Waiting Time Variance in the Single Machine Problem

1977 ◽  
Vol 23 (6) ◽  
pp. 567-575 ◽  
Author(s):  
Samuel Eilon ◽  
I. G. Chowdhury
Keyword(s):  
Waiting Time ◽  
Single Machine ◽  
Time Variance ◽  
Waiting Time Variance ◽  
Machine Problem

The effect of queue discipline on waiting time variance

1962 ◽  
Vol 58 (1) ◽  
pp. 163-164 ◽  
Author(s):  
J. F. C. Kingman
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Present Note ◽  
Waiting Time Distribution ◽  
Time Variance ◽  
Queue Discipline ◽  
The Mean ◽  
Waiting Time Variance

It is usual in the theory of queues to assume that customers are served in the order of their arrival. In some applications (e.g. telephone engineering), however, other forms of queue discipline are more realistic. The precise effect of any such change on the waiting-time distribution of a customer will depend on the procedure envisaged (random service, “last come, first served”, etc.), but it is possible to make certain general statements. Thus it is well known that, under certain conditions, the mean is independent of the queue discipline. The purpose of the present note is to consider the variance of waiting time, and we shall prove that this is a minimum when the customers are served in order of arrival. Thus this is, in a sense, the “fairest” queue discipline. This does not, of course, mean that other procedures may not be justified when different criteria are taken into account.

Influencing factors of job waiting time variance on a single machine

2007 ◽  
Vol 1 (1) ◽  
pp. 56 ◽  
Author(s):  
Xueping Li ◽  
Nong Ye ◽  
Xiaoyun Xu ◽  
Rapinder Sawhey
Keyword(s):  
Influencing Factors ◽  
Waiting Time ◽  
Single Machine ◽  
Time Variance ◽  
Waiting Time Variance
Sign in / Sign up

Export Citation Format

Share Document