Data warehouse is a centralized repository for analyzing and storing huge amount of data. In distributed data warehouse, data can be shared across multiple data repositories which belong to one or more organizations. Query sorting is one of the issues for formatting the number of queries that can be selected together. Reducing the usual completion period of a random order is a common concern. In this paper, we are dealing three scheduling algorithms for query scheduling and the performance report based on processing time and memory size is also evaluated. The algorithms discussed are Optimal Resource Constraints (ORC), Grouping based Fine-grained Job Scheduling (GFJS) and Heuristic Algorithm (HA). ORC allocates queries according to their processor's capabilities. GFJS is based on resource characteristics. HA selects some possible schedules that are having the shortest sum of completion time and this set contains the optimal one.

1. Carsten Ernemann, Volker Hamscher, Uwe Schwiegelshohn and Ramin Yahyapour, "On Advantageous of Grid Computing for Parallel Job Scheduling," 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 39-46, 2002.
2. C. G. Petersen, "An Evaluation of Order Picking Routing Policies," International Journal of Operations & Production Management, vol. 17, Iss. 11, pp. 1098–1111, 1997.
3. Claus Bitten, Joern Gehring, Uwe Schwiegelshohn and Ramin Yahyapour, "The NRW-Metacomputer-Building Block for a Worldwide Computational Grid," 9th Heterogeneous Computing Workshop, pp. 31-40, 2000.
4. Diana Moise, Izabela Moise, Florin Pop and Valentin Cristea, "Resource CoAllocation for Scheduling Tasks with Dependencies in Grid," International Workshop on High Performance in Grid Middleware, pp. 41-48, 2008.
5. E. Grace Mary Kanaga, M. L. Valarmathi and Juliet A Murali, "Agent Based Patient Scheduling Using Heuristic Algorithm," International Journal on Computer Science and Engineering vol. 2, pp. 69-75, 2010.
6. J. A. Tompkins, J. A. White, Y. A. Bozer and J. M. A. T. Tanchoco, "Facilities Planning," John Wiley and Sons, New York: chap. 7, pp. 432-444, 2003.
7. Quan Liu and Yeqing Liao, "Grouping-Based Fine-grained Job Scheduling in Grid Computing," 1st IEEE International Workshop on Education Technology and Computer Science, pp. 556-559, 2009.
8. Raksha Sharma, Vishnu Kant Soni, Manoj Kumar Mishra and Prachet Bhuyan, "A Survey of Job Scheduling and Resource Management in Grid Computing," World Academy of Science, Engineering and Technology, vol. 64, pp. 461-466, 2010.
9. Roodbergen, K. J. , De Koster, R. , 2001. Routing Methods for Warehouses with Multiple Cross Aisles. International Journal of Production Research 39 (9), 1865–1883.
10. Sebastian Henn and Gerhard Wäscher, "Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems," European Journal of Operational Research, Accepted manuscript, pp. 1-31, 2012.
11. Somasundaram, K. and S. Radhakrishnan, "Node Allocation in Grid Computing using Optimal Resource Constraint (ORC) Scheduling," International Journal of Computer Science and Network Security, vol. 8, Iss. 6, pp. 309-313, 2008.
12. Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan, Sadayappan, P. , 2002. Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests. 11th IEEE International Symposium on High Performance Distributed Computing, 359-366.
13. Vishnu Kant Soni, Raksha Sharma and Manoj Kumar Mishra, "Grouping-Based Job Scheduling Model in Grid Computing," World Academy of Science, Engineering and Technology, vol. 65, pp. 781-784, 2010.
14. Yeqing Liao and Quan Liu, "Research on Fine-grained Job Scheduling in Grid Computing," International Journal of Information Engineering and Electronic Business, pp. 9-16, 2009.

Data Warehouse Optimal Resource Constraints (orc) Grouping Based Fine-grained Job Scheduling (gfjs) Heuristic Algorithm (ha)