Sharma Prabha

Prabha Sharma

Information about the author Prabha Sharma will soon be added to the site.
Found 6 papers in total
An efficient local search for minimizing completion time variance in permutation flow shops
An efficient local search for minimizing completion time variance in permutation flow shops
2012
This paper illustrates that by exploiting the structure of hard combinatorial...
An efficient local search scheme for minimizing mean absolute deviation of completion times
An efficient local search scheme for minimizing mean absolute deviation of completion times
2011
We present a two phase local search scheme for finding a sequence of n jobs to be...
An efficient heuristic algorithm for the bottleneck traveling salesman problem
An efficient heuristic algorithm for the bottleneck traveling salesman problem
2009
This paper describes a new heuristic algorithm for the bottleneck traveling salesman...
Algorithms for the optimum communication spanning tree problem
Algorithms for the optimum communication spanning tree problem
2006
Optimum Communication Spanning Tree Problem is a special case of the Network Design...
A combinatorial arc tolerance analysis for network flow problems
A combinatorial arc tolerance analysis for network flow problems
2005
For the separable convex cost flow problem, we consider the problem of determining...
Permutation polyhedra and minimisation of the variance of completion times on a single machine
Permutation polyhedra and minimisation of the variance of completion times on a single machine
2002
We consider the problem of minimising variance of completion times when n -jobs are to...
Papers per page: