Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 768374, 10 pages
http://dx.doi.org/10.1155/2014/768374
Research Article

Scheduling IT Staff at a Bank: A Mathematical Programming Approach

Department of Industrial Engineering, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia

Received 16 November 2013; Accepted 28 January 2014; Published 17 March 2014

Academic Editors: S. Casado and N. Matsatsinis

Copyright © 2014 M. Labidi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff scheduling and rostering: a review of applications, methods and models,” European Journal of Operational Research, vol. 153, no. 1, pp. 3–27, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. M. J. Brusco and L. W. Jacobs, “A simulated annealing approach to the cyclic staff-scheduling problem,” Naval Research Logistics, vol. 40, no. 1, pp. 69–84, 1993. View at Google Scholar · View at Scopus
  3. E. K. Burke, P. de Causmaecker, and G. Vanden Berghe, “A hybrid tabu search algorithm for the nurse rostering problem,” in Proceedings of the 2nd Asia-Pacific Conference on Simulated Evolution and Learning (SEAL '98), pp. 187–194, Canberra, Australia, November 1998.
  4. U. Aickelin and K. A. Dowsland, “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem,” Journal of Scheduling, vol. 3, no. 3, pp. 139–153, 2000. View at Google Scholar · View at Scopus
  5. B. Maenhout and M. Vanhoucke, “The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach,” Journal of the Operational Research Society, vol. 60, no. 12, pp. 1683–1698, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Beliën and E. Demeulemeester, “A branch-and-price approach for integrating nurse and surgery scheduling,” European Journal of Operational Research, vol. 189, no. 3, pp. 652–668, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. C. Valouxis, C. Gogos, G. Goulas, P. Alefragis, and E. Housos, “A systematic two phase approach for the nurse rostering problem,” European Journal of Operational Research, vol. 219, no. 2, pp. 425–433, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Firat and C. A. J. Hurkens, “An improved MIP-based approach for a multi-skill workforce scheduling problem,” Journal of Scheduling, vol. 15, no. 3, pp. 363–380, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. M. A. Louly, “A goal programming model for staff scheduling at a telecommunications center,” Journal of Mathematical Modelling and Algorithms in Operations Research, vol. 12, no. 2, pp. 167–178, 2013. View at Publisher · View at Google Scholar
  10. V. Dück, L. Ionescu, N. Kliewer, and L. Suhl, “Increasing stability of crew and aircraft schedules,” Transportation Research C, vol. 20, no. 1, pp. 47–61, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Alfieri, L. Kroon, and S. van de Velde, “Personnel scheduling in a complex logistic system: a railway application case,” Journal of Intelligent Manufacturing, vol. 18, no. 2, pp. 223–232, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. C. Stark and J. Zimmermann, “An exact branch-and-price algorithm for workforce scheduling,” in Operations Research Proceedings 2004, vol. 2004 of Operations Research Proceedings, pp. 207–212, Springer, Tilburg, The Netherlands, 2005. View at Publisher · View at Google Scholar