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

Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

Industrial Management, School of Engineering, University of Seville, Camino de los Descubrimientos, s/n, 41092 Seville, Spain

Received 11 January 2014; Accepted 19 February 2014; Published 24 April 2014

Academic Editors: J. G. Barbosa and D. Oron

Copyright © 2014 Victor Fernandez-Viagas and Jose M. Framinan. 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. R. J. Tersine and E. A. Hummingbird, “Lead-time reduction: the search for competitive advantage,” International Journal of Operations and Production Management, vol. 15, no. 2, pp. 8–18, 1995. View at Publisher · View at Google Scholar · View at Scopus
  2. C. H. Glock, “Lead time reduction strategies in a single-vendorsingle-buyer integrated inventory model with lot size-dependent lead times and stochastic demand,” International Journal of Production Economics, vol. 136, no. 1, pp. 37–44, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. E. Nowicki and S. Zdrzałka, “A survey of results for sequencing problems with controllable processing times,” Discrete Applied Mathematics, vol. 26, no. 2-3, pp. 271–287, 1990. View at Google Scholar · View at Scopus
  4. A. A. Fernandez, R. L. Armacost, and J. J. Pet-Edwards, “Understanding simulation solutions to resource constrained project scheduling problems with stochastic task durations,” Engineering Management Journal, vol. 10, no. 4, pp. 5–13, 1998. View at Google Scholar · View at Scopus
  5. B. L. Maccarthy and J. Liu, “Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling,” International Journal of Production Research, vol. 31, no. 1, pp. 59–79, 1993. View at Google Scholar · View at Scopus
  6. M. H. A. Hendriks, B. Voeten, and L. Kroep, “Human resource allocation in a multi-project R&D environment: resource capacity allocation and project portfolio planning in practice,” International Journal of Project Management, vol. 17, no. 3, pp. 181–188, 1999. View at Google Scholar · View at Scopus
  7. A. Corominas, J. Ojeda, and R. Pastor, “Multi-objective allocation of multi-function workers with lower bounded capacity,” Journal of the Operational Research Society, vol. 56, no. 6, pp. 738–743, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Corominas, R. Pastor, and E. Rodríguez, “Rotational allocation of tasks to multifunctional workers in a service industry,” International Journal of Production Economics, vol. 103, no. 1, pp. 3–9, 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. S. P. Siferd and W. C. Benton, “Workforce staffing and scheduling: hospital nursing specific models,” European Journal of Operational Research, vol. 60, no. 3, pp. 233–246, 1992. View at Google Scholar · View at Scopus
  10. W. J. Abernathy, N. Baloff, J. C. Hershey, and S. Wandel, “A three stage manpower planning and scheduling model—a service sector example,” Abstracts of Hospital Management Studies, vol. 9, no. 4, Article ID 09928, 30 pages, 1973. View at Google Scholar · View at Scopus
  11. C. Tseng, C. Liao, and K. Huang, “Minimizing total tardiness on a single machine with controllable processing times,” Computers and Operations Research, vol. 36, no. 6, pp. 1852–1858, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Shabtay and G. Steiner, “A survey of scheduling with controllable processing times,” Discrete Applied Mathematics, vol. 155, no. 13, pp. 1643–1666, 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. E. L. Demeulemeester and W. Herroelen, Project Scheduling, Kluwer Academic Publishers, Boston, Mass, USA, 2002.
  14. O. Bellenguez and E. Néron, “Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills,” in Practice and Theory of Automated Timetabling V, vol. 3616 of Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 229–243, Springer, 2005. View at Google Scholar
  15. O. Bellenguez-Morineau and E. Néron, “A branch-and-bound method for solving multi-skill project scheduling problem,” RAIRO—Operations Research, vol. 41, no. 2, pp. 155–170, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Brucker and S. Knust, Complex Scheduling, GOR-Publications, 2012.
  17. L.-E. Drezet and J.-C. Billaut, “A project scheduling problem with labour constraints and time-dependent activities requirements,” International Journal of Production Economics, vol. 112, no. 1, pp. 217–225, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. G. L. Vairaktarakis, “The value of resource flexibility in the resource-constrained job assignment problem,” Management Science, vol. 49, no. 6, pp. 718–732, 2003. View at Google Scholar · View at Scopus
  19. V. Valls, Á. Pérez, and S. Quintanilla, “Skilled workforce scheduling in Service Centres,” European Journal of Operational Research, vol. 193, no. 3, pp. 791–804, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Corominas, J. Olivella, and R. Pastor, “A model for the assignment of a set of tasks when work performance depends on experience of all tasks involved,” International Journal of Production Economics, vol. 126, no. 2, pp. 335–340, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. A. Drexl, “Scheduling of project networks by job assignment,” Management Science, vol. 37, no. 12, pp. 1590–1602, 1991. View at Google Scholar · View at Scopus
  22. B. Dodin and A. A. Elimam, “Audit scheduling with overlapping activities and sequence-dependent setup costs,” European Journal of Operational Research, vol. 97, no. 1, pp. 22–33, 1997. View at Publisher · View at Google Scholar · View at Scopus
  23. C. Heimerl and R. Kolisch, “Scheduling and staffing multiple projects with a multi-skilled workforce,” OR Spectrum, vol. 32, no. 2, pp. 343–368, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. R. Kolisch and C. Heimerl, “An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network,” Naval Research Logistics, vol. 59, no. 2, pp. 111–127, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. W. J. Gutjahr, S. Katzensteiner, P. Reiter, C. Stummer, and M. Denk, “Competence-driven project portfolio selection, scheduling and staff assignment,” Central European Journal of Operations Research, vol. 16, no. 3, pp. 281–306, 2008. View at Publisher · View at Google Scholar · View at Scopus
  26. W. J. Gutjahr, S. Katzensteiner, P. Reiter, C. Stummer, and M. Denk, “Multi-objective decision analysis for competence-oriented project portfolio selection,” European Journal of Operational Research, vol. 205, no. 3, pp. 670–679, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. M. Wu and S. Sun, “A project scheduling and staff assignment model considering learning effect,” International Journal of Advanced Manufacturing Technology, vol. 28, no. 11-12, pp. 1190–1195, 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. H. K. Alfares and J. E. Bailey, “Integrated project task and manpower scheduling,” IIE Transactions (Institute of Industrial Engineers), vol. 29, no. 9, pp. 711–717, 1997. View at Google Scholar · View at Scopus
  29. M. Bassett, “Assigning projects to optimize the utilization of employees' time and expertise,” Computers and Chemical Engineering, vol. 24, no. 2–7, pp. 1013–1021, 2000. View at Publisher · View at Google Scholar · View at Scopus
  30. R. M. Hachicha, E. M. Dafaoui, and A. El Mhamedi, “Assignment problem formulation under competence and preference constraints,” in Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM '10), pp. 1864–1868, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  31. C. Heimerl and R. Kolisch, “Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets,” International Journal of Production Research, vol. 48, no. 13, pp. 3759–3781, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Węglarz, J. Józefowska, M. Mika, and G. Waligóra, “Project scheduling with finite or infinite number of activity processing modes—a survey,” European Journal of Operational Research, vol. 208, no. 3, pp. 177–205, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. S. Hartmann and D. Briskorn, “A survey of variants and extensions of the resource-constrained project scheduling problem,” European Journal of Operational Research, vol. 207, no. 1, pp. 1–14, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. D. W. Pentico, “Assignment problems: a golden anniversary survey,” European Journal of Operational Research, vol. 176, no. 2, pp. 774–793, 2007. View at Publisher · View at Google Scholar · View at Scopus
  35. J. N. D. Gupta, K. Krüger, V. Lauff, F. Werner, and Y. N. Sotskov, “Heuristics for hybrid flow shops with controllable processing times and assignable due dates,” Computers and Operations Research, vol. 29, no. 10, pp. 1417–1439, 2002. View at Publisher · View at Google Scholar · View at Scopus
  36. R. M. Belbin, Management Teams, Butterworth-Heinemann, Oxford, UK, 3rd edition, 2010.
  37. D. Shabtay and M. Kaspi, “Minimizing the total weighted flow time in a single machine with controllable processing times,” Computers and Operations Research, vol. 31, no. 13, pp. 2279–2289, 2004. View at Publisher · View at Google Scholar · View at Scopus
  38. C. L. Monma, A. Schrijver, M. J. Todd, and V. K. Wei, “Convex resource allocation problems on directed acyclic graphs: duality, complexity,” Special Cases, and Extensions, Mathematics of Operations Research, vol. 15, pp. 736–748, 1990. View at Google Scholar
  39. C. Lee and L. Lei, “Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases,” Annals of Operations Research, vol. 102, no. 1–4, pp. 287–307, 2001. View at Publisher · View at Google Scholar · View at Scopus
  40. M. J. Lanigan, “Task estimating: completion time versus team size,” Engineering Management Journal, vol. 4, no. 5, pp. 212–218, 1994. View at Google Scholar · View at Scopus
  41. P. C. Pendharkar and J. A. Rodger, “An empirical study of the impact of team size on software development effort,” Information Technology and Management, vol. 8, no. 4, pp. 253–262, 2007. View at Publisher · View at Google Scholar · View at Scopus
  42. K. G. Smith, K. A. Smith, J. D. Olian, H. P. Sims Jr, D. P. O'Bannon, and J. A. Scully, “Top management team demography and process: the role of social integration and communication,” Administrative Science Quarterly, vol. 39, pp. 412–438, 1994. View at Google Scholar
  43. M. A. Cusumano and R. W. Selby, Microsoft Secrets, The Free Press, New York, NY, USA, 1995.
  44. E. Demeulemeester, B. de Reyck, and W. Herroelen, “The discrete time/resource trade-off problem in project networks: a branch-and-bound approach,” IIE Transactions (Institute of Industrial Engineers), vol. 32, no. 11, pp. 1059–1069, 2000. View at Google Scholar · View at Scopus
  45. M. R. Ranjbar and F. Kianfar, “Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms,” Applied Mathematics and Computation, vol. 191, no. 2, pp. 451–456, 2007. View at Publisher · View at Google Scholar · View at Scopus
  46. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Scopus
  47. J. K. Lenstra and A. H. G. R. Kan, “Complexity of scheduling under precedence constraints,” Operations Research, vol. 26, no. 1, pp. 22–35, 1978. View at Google Scholar · View at Scopus
  48. T. A. Feo and M. G. C. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,” Operations Research Letters, vol. 8, no. 2, pp. 67–71, 1989. View at Google Scholar · View at Scopus
  49. P. Festa and M. G. C. Resende, GRASP: An Annotated Bibliography, pp. 325–367, Kluwer Academic Publishers, Boston, Mass, USA, 2001.
  50. R. Kolisch and A. Sprecher, “PSPLIB—a project scheduling problem library,” European Journal of Operational Research, vol. 96, no. 1, pp. 205–216, 1997. View at Google Scholar · View at Scopus
  51. R. Kolisch, A. Sprecher, and A. Drexl, “Characterization and generation of a general class of resource-constrained project scheduling problems,” in Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems: Easy and Hard Instances, Institute for Operations Research and the Management Sciences, 1992. View at Google Scholar