This paper presents a genetic algorithmic approach to the solution of the problem of personnel timetabling in laboratories in which the objective is to assign tasks to employees and nurse scheduling in medical centre where the objectives are to assign staff to particular day in planning period and minimization of personnel cost by avoiding overtime pay. The personnel scheduling and timetabling problems are multi-constrained and having huge search space which makes them NP hard. Genetic algorithmic approach is applied to both the problems. Canonical genetic algorithm demonstrates very slow convergence to optimal solution. Hence, in laboratory personnel timetabling problem a knowledge augmented operator is introduced in genetic algorithm framework. This hybridization helps to get the near-optimal solution quickly. For nurse scheduling problem, proposed hybrid genetic algorithms with partial feasible chromosome representation, initialization and operators have shown fast convergence towards optimal solution with comparatively small population size. The probability of getting near optimal solution using proposed hybrid genetic algorithm in less than 20 seconds (the average time) is more than 0.6. Timetabling and scheduling problems under consideration are quite different from each other. Hence choice of genetic operators and parameters for both the problems are different. Finding a general framework for timetabling and scheduling problems is still a challenge.

1. A. Aho, R. Sethi, and J. Ullman, “Compilers: Principles, Techniques and Tools”, Addison-Wesley, 2nd ed, 2006.
2. Aaron Skonnard, Understanding WSDL, Microsoft Corporation, 2010, http://msdn.microsoft.com/en-us/library/ms996486(printer).aspx, Accessed on 30th Aug 2010
3. Abu-Ghazaleh N., Govindraju M., Lewis M. J., Optimizing performance of web services with chunk-overlaying and pipelined-send. Proceedings of the International Conference on Internet Computing (ICIC), June 2003, 482–485.
4. Apache Software Foundation, Xerces2 Java Parser, http://xml.apache.org/xerces2-j, Accessed on 23 July 2010
5. A. Slominski, XML Pull Parser version 2.1.8.,
6. C. Chan, P. Felber, M. Garofalakis and R. Rastogi, “Efficient Filtering of XML Documents with XPath Expressions”, In Proceedings of the International Conference on Data Engineering, 2002.
7. C. Kohlhof and R. Steele, “Evaluating SOAP for high performance business applications: Real-time trading systems”, In proceedings of the 2003 International WWW Conference, Budapest, Hungary.
8. D. Davis and M. Parashar, “Latency performance of SOAP implementations”, In proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid, 2002.
9. Danny Chen, Raymond K. Wong, “Optimizing The Lazy DFA Approach for XML Stream Processing”, The Fifteenth Australasian Database, Conference (ADC2004), Dunedin, New Zealand, Vol. 27, 2004
10. F. Neven, “Automata theory for XML researchers”, SIGMOD Record, 31(3), 2002
11. Girish Tere, Bharat Jadhav, Improving Performance of XML Web Services, ICTSM 2011, CCIS 145, pp. 91–98, 2011, Springer-Verlag Berlin Heidelberg 2011
12. K. Chiu, W. Lu, “Compiler-based approach to schema-specific XML parsing”, First International Workshop on High Performance XML Processing, New York, USA, May 17–22, 2004, ACM Press, 2004.
13. K. Chiu, M. Govindaraju, and R. Bramley, “Investigating the limits of SOAP performance for scientific Computing”, In proceedings of the 11th IEEE International Symposium on High-Performance Distributed Computing, 2002.
14. Lei Li, Chunlei Niu, Ningjiang Chen, Jun Wei, "High Performance Web Services Based on Service-Specific SOAP Processor", IEEE International Conference on Web Services (ICWS'06), 2006, pp 603-610
15. M. Murata, D. Lee, and M. Mani, “Taxonomy of XML schema languages using formal language theory”, In Extreme Markup Languages, 2001.
16. R. van Engelen, “Pushing the SOAP envelope with Web services for scientific computing”, In proceedings of the International Conference on Web Services (ICWS), pages 346–352, Las Vegas, 2003.
17. R. van Engelen and K. Gallivan, “The gSOAP toolkit for web services and peer-to-peer computing networks”, In 2nd IEEE International Symposium on Cluster Computing and the Grid, 2002.
18. R. van Engelen, G. Gupta, and S. Pant, “Developing web services for C and C++”, IEEE Internet Computing, March 2003, pp 53-61
19. T. Green, G. Miklau, M. Onizuka, D. Suciu, “Processing XML Streams with Deterministic Automata”, 9th International Conference on Database Theory, Siena, Italy, 8-10 January 2003.
20. The Apache Xerces Project, http://xerces.apache.org/, Accessed on 17th March 2011
21. Welf M. Löwe, M. L. Noga and T. S. Gaul, ‘‘Foundations of Fast Communication via XML”, Annals of Software Engineering 13, Nos. 1–4, 357–359 (June 2002).
22. Wei Zhang, Robert A. van Engelen, “An Adaptive XML Parser for Developing High-Performance Web Services”, Fourth IEEE International Conference on eScience, 2008, pp 672-679
23. Wei Zhang van Engelen, R.A., “High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers”, ICWS '08. IEEE International Conference on Web Services, 2008, Beijing, pp 286 – 294
24. Wim Martens, Joachim Niehren, On the minimization of XML Schemas and tree automata for unranked trees, Journal of Computer and System Sciences, Vol 73 Issue 4, June 2007
25. XMLTK, The XML toolkit, http://www.cs.washington.edu/homes/suciu/XMLTK/, University of Washington, 2002, Accessed on 25 Aug 2010
26. Wichaiwong, T. Jaruskulchai, C., A Simple Approach to Optimize Web Services' Performance, Third International Conference on Next Generation Web Services Practices, NWeSP, Seoul 2007, pp 43-48

Deterministic Finite Automata SOAP WSDL XML documents