Objeto y ámbito de aplicación

There are a number of possible extensions to this project which, given more time and resources would be interesting to implement.

• Full length user acceptance test of the software, on a number of wards, across a number of health authorities.

• Direct comparison of performance with other algorithms, such as Tabu search [18], by adding extra classes into the application.

• Adding the ability for users to store rosters on a central server

• Add a “manager” interface to allow analysis and comparisons of rosters between wards.

• A semi- natural language processing system for specifying constraints would be an interesting piece of research work, and would perhaps help overcome some of the limitations with the project’s representation of constraints, particularly complex constraints.

• Allowing the user to specify complex and arbitrary orderings upon constraints and using a more sophisticated method of ranking to evaluate rosters would also be an interesting piece of research. Such extensions would more accurately represent the human perception of roster fitness.

• Replace the hill climbing algorithms with a different approach such as simulated annealing [28] or Tabu search [18].

10 References

[1] THE ROYAL COLLEGE OF NURSING, “Children’s Services: Acute Health care provision”. (001055)

[2] GROBNER, M. WILKE, P. “Rostering with a Hybrid Genetic Algorithm”, Proceedings of 5th International conference on Artificial Neural networks and Genetic Algorithms, Springer 2001.

[3] E.K. BURKE, P. DE CAUSMAECKER, S. PETROVIC, G. VANDEN BERGHE. A Multi Criteria Meta-heuristic Approach to Nurse Rostering, Proceedings of Congress on Evolutionary Computation, CEC2002, Honolulu, IEEE Press, 2002, 1197-1202

[4] COOPER J W. 2000 Java Design Patterns . Harlow : Addison Wesley Longman

[5] PRIESTLEY M, 1996 Practical Object oriented design with UML London : McGraw-Hill

[6] GYORI, S. PETRES, Z. VÁRKONYI-KÓCZY , A R. 2001. Genetic Algorithms In Timetabling: A new Approach. INES’2001 Conference [7] DAVID E. GOLDBERG, "Genetic Algorithms in Search, Optimization, and

Machine Learning", Addison-Wesley Pub Co, 01 January, 1989.

[8] BEASLEY, D., BULL, D.R. AND MARTIN, R.R.. An overview of genetic algorithms part 1 fundamentals. Technical report, University of Purdue, 1993.

[9] BOUKREEV, K. 2001, The TSP Problem using Genetic Algorithms. Sample Code, Available From : www.codeproject.com/cpp/tspapp.asp

[10] LALENA, M. The TSP Problem using Genetic Algorithms. Available From: www.lalena.com

[11] ANON, Genetic Algorithms . Available From:

http://www.htc.honeywell.com/projects/neurogen/Genetic_Algorithms.htm [12] THE Z USER GROUP, The Z User Group (ZUG) Homepage. Available

From: http://www.zuser.org/z/

[13] DUKE, R. ROSE, G . 2000, Formal OO specification using object-Z. Macmillan

[14] DUKE, R. KING, P. ROSE, G A. SMITH, G. 1991, The Object-Z

specification language. In T. Korson, V. Vaishnavi, and B. Meyer, editors, Technology of Object-Oriented Languages and Systems (TOOLS 5), pages 465-483. Prentice Hall, 1991.

[15] LIU, J. DONG, J. S. MAHONY, B. SHI, K. 2000 Linking UML with integrated formal techniques. Unified Modelling Language: Systems Analysis, Design, and Development Issues

[16] DAVIES, J. WOODCOCK, J. 1996. Using Z: Specification, Refinement, and Proof (Formal techniques and formal methods for software

engineering) Prentice Hall

[17] THE OBJECT MANAGEMENT GROUP. UML Specification. Available from: http://www.omg.org/technology/documents/formal/uml.htm

[18] BURKE, E., DE CAUSMAECKER, P., VANDEN BERGHE, G., A hybrid tabu search algorithm for the nurse rostering problem, Proceedings of the

Second Asia-Pacific Conference on Simulated Evolution and Learning (SEAL '98), Canberra

[19] CHENG, B M W. LEE, J H M. WU, J C K . A constraint-based nurse rostering system using a redundant modelling approach. Technical report, Department of Computer Science and Engineering at The Chinese

University of Hong Kong,1996.

[20] MONFROGLIO, A. 1996, Hybrid Genetic Algorithms for a Rostering Problem. Softw., Pract. Exper. 26 , 1996, 851-862.

[21] MEYER AUF’M HOFE H. 2000, Solving rostering tasks as constraint optimization. In Selected Papers from the 3rd international conference on Practice and Theory of Automated Timetabling (PATAT),Springer-Verlag Lecture Notes on Computer Science, pages 280–297. 2000

[22] CHENG, B M W . LEE, J H M . WU, J C K. A constraint-based nurse rostering system using a redundant modelling approach. Technical report, Department of Computer Science and Engineering at The Chinese

University of Hong Kong, 1996.

[23] HOFE, H M. 2001. Solving Rostering Tasks by Generic Methods for Constraint Optimization. Int. J. Found. Comput. Sci. volume 12, 2001, 671-693

[24] BURKE, E., DE CAUSMAECKER, P., VANDEN BERGHE, G, 2001, A Memetic Approach to the Nurse Rostering Problem. Appl. Intell.,15, 199- 214

[25] LIM, A. HAIBING, L. RODRIGUES, B. 2003 A Hybrid AI Approach for Nurse Rostering Problem. Proceedings of the 2003 ACM symposium on Applied computing. Melbourne, Florida 730-735

[26] WONG, Y C and CHUN, A H W, "Nurse Rostering Using Constraint Programming and Meta-Level Reasoning", Proceedings of the 16th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-2003),

Loughborough, United Kingdom, June 2003

[27] AICKELIN, U AND DOWSLAND, K A. 2004, An indirect genetic algorithm for a nurse scheduling problem

[28] BRUSCO, MJ. JACOBS, LW. Cost analysis of alternative formulations for personnel scheduling in continuously operating organisations. European Journal of Operations Research 86,1995, 249-261

[29] FRANZ, LS. BAKER, LS. LEONG, LS. RAKES, TR. Mathematical model for scheduling and staffing multi-clinic health regions. European Journal of Operations Research vol 41, no 3, 1989, 277-289

[30] E.K. BURKE, P. DE CAUSMAECKER, S. PETROVIC, G. VANDEN BERGHE: Variable Neighbourhood Search for Nurse Rostering Problems, in Metaheuristics: Computer Decision-Making (edited by Mauricio G.C. Resende and Jorge Pinho de Sousa), Chapter 7, Kluwer, 2003, 153-172 [31] KEENEY, R. L., & RAIFFA, H. 1993. Decisions with multiple objectives:

Preferences and value tradeoffs. New York: Cambridge University Press, ISBN: 0521438837. (Richard Gonzalez, Psychology Department)

[32] EDWARDS, W., & BARRON, F.H. 1994. SMARTS and SMARTER: Improved simple methods for multi-attribute utility measurement. Organizational Behaviour and Human Decision Processes, 60, 306-325.

[33] MANGIONE , C. Performance tests show Java as fast as C++

Available from: http://www.javaworld.com/javaworld/jw-02-1998/jw-02- jperf.html

[34] LEWIS, C. RIEMAN, J. (1993) Task-Centred User Interface Design: A Practical Introduction. Available From:

http://www.cpsc.ucalgary.ca/grouplab/saul/hci_topics/tcsd- book/contents.html

[35] ISO13407: 1999, Human-centred design processes for interactive systems. [36] NECTAR. INUSE 6.2 Handbook of User-Centred Design. Available From:

http://www.ejeisa.com/nectar/inuse/6.2/contents.htm

[37] GOULD, J D. CLAYTON, L. 1983. "Designing for usability -- key principles and what designers think" Human Factors in Computing Systems, CHI '83 Proceedings. New York: ACM.

[38] WALRATH, K. CAMPIONE, M. HUML, A. ZAKHOUR, S The JFC Swing Tutorial . Available from: http://java.sun.com

[39] MITCHELL, M. HOLLAND, J H. FORREST, S. 1994 When will a Genetic Algorithm Outperform Hill Climbing? Advances In Neural Information Processing Systems 6. Morgan Kaufmann

[40] DAVIS, LD. 1991. Bit-Climbing, representational bias and test suite design. In RK Belew and LB Booker (eds.) Proceedings of the forth International Conference on Genetic Algorithms, 18-23. San Mateo, CA: Morgan Kaufmann

[41] JOHNSON, A W. JACOBSON, SH. 1996 Generalized hill-climbing algorithms for discrete optimization problems

[42] HOLLAND, J. H. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence . Ann Arbor: Univ. of Michigan Press, 1975.

11 Appendices