Skip to main content
SpringerLink
Log in

Branch-and-price approach for the multi-skill project scheduling problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This work introduces a procedure to solve the multi-skill project scheduling problem (MSPSP) (Néron and Baptista, International symposium on combinatorial, optimization (CO’2002), 2002). The MSPSP mixes both the classical resource constrained project scheduling problem and the multi-purpose machine model. The aim is to find a schedule that minimizes the completion time (makespan) of a project, composed of a set of activities. In addition, precedence relations and resources constraints are considered. In this problem, resources are staff members that master several skills. Thus, a given number of workers must be assigned to perform each skill required by an activity. Practical applications include the construction of buildings, as well as production and software development planning. We present a column generation approach embedded within a branch-and-price (B&P) procedure that considers a given activity and time-based decomposition approach. Obtained results show that the proposed B&P procedure is able to reach optimal solutions for several small and medium sized instances in an acceptable computational time. Furthermore, some previously open instances were optimally solved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. Here, given values \(es_i\) (resp. \(ls_i\)) denotes a lower bound (resp. upper bound) for the starting date associated with activity \(A_i\). These values can be for instance simply induced by the precedence graph using recursively Bellman’s conditions upon a considered upper bound for the makespan.

References

  1. Artigues, C., Demassey, S., Néron, E., Ebooks Corporation: Resource-constrained project scheduling. Wiley Online Library, New York (2008)

  2. Baptiste, P., Le Pape, C., Nuijten, W.: Satisfiability tests and time-bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92, 305–333 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bard, J.F., Purnomo, H.W.: Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2), 510–534 (2005)

    Article  MATH  Google Scholar 

  4. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 316–329 (1998)

  5. Beliën, J., Demeulemeester, E.: On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. Ann. Oper. Res. 155(1), 143–166 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bellenguez-Morineau, O.: Methods to solve multi-skill project scheduling problem. 4OR Q. J. Oper. Res. 6(1), 85–88 (2008)

    Article  MATH  Google Scholar 

  7. Bellenguez-Morineau, O., Néron, E.: Tabu search for the multi-skill project scheduling problem. J. Oper. Logist. (to appear)

  8. Bellenguez-Morineau, O., Néron, E.: Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. In: Practice and Theory of Automated Timetabling V: 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, revised selected papers, pp. 229–243 (2005)

  9. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3–41 (1999)

    Article  MATH  Google Scholar 

  10. Busacker, R.G., Gowen, P.J.: A procedure for determining a family of minimum-cost-flow patterns. Oper. Res. Off. Tech. Rep. 15, 1961

  11. Carlier, J., Latapie, B.: Un méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO. Recherche opérationnelle 25(3), 311–340 (1991)

    MATH  MathSciNet  Google Scholar 

  12. Chen, Z.L., Powell, W.B.: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur. J. Oper. Res. 116(1), 220–232 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched., 1–17 (2010)

  14. Correia, I., Lourenço, L.L., Saldanha-da Gama, F.: Project scheduling with flexible resources; formulation and inequalities. OR Spectr. 34, 635–663 (2012)

    Article  MATH  Google Scholar 

  15. Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101–111 (1960)

    Article  MATH  Google Scholar 

  16. Dohn, A., Kolind, E., Clausen, J.: The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput. Oper. Res. 36(4), 1145–1157 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Fırat, M., Hurkens, C.A.J.: An improved mip-based approach for a multi-skill workforce scheduling problem. J. Schedul., 1–18 (2011)

  18. Gélinas, S., Soumis, F.: Dantzig–Wolfe decomposition for job shop scheduling. Column Gener., 271–302 (2005)

  19. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849–859 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  20. Heimerl, C., Kolisch, R.: Scheduling and staffing multiple projects with a multi-skilled workforce. OR spectr. 32(2), 343–368 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  21. Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1), 1–18 (1998)

    Article  MATH  Google Scholar 

  22. Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: theory and applications, Part I and II. Ann. Oper. Res. 128, 1–4 (2004)

    MathSciNet  Google Scholar 

  23. Kolisch, R., Sprecher, A.: Project scheduling problem library-psplib. línea. Consulta 13. http://www.bwl.uni-kiel.de/Prod/psplib/ (2000)

  24. Li, H., Womer, K.: Scheduling projects with multi-skilled personnel by a hybrid milp/cp benders decomposition algorithm. J. Schedul. 12(3), 281–298 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  25. Lübbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res., 1007–1023 (2005)

  26. Mason, A.J., Smith, M.C.: A nested column generator for solving rostering problems with integer programming. In: International Conference on Optimisation: Techniques and Applications, pp. 827–834. Citeseer (1998)

  27. Mehrotra, A., Murphy, K.E., Trick, M.A.: Optimal shift scheduling: a branch-and-price approach. Naval Res. Logist. (NRL) 47(3), 185–200 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag. Sci., 714–729 (1998)

  29. Néron, E., Baptista, D.: Heuristics for multi-skill project scheduling problem. In: International Symposium on Combinatorial, Optimization (CO’2002) (2002)

  30. Néron, E., Carlier, J.: Du flow-shop hybride au probleme cumulatif (1999)

  31. Patterson, J,H., Slowinski, R., Talbot, F.B., Weglarz, J.: An algorithm for a general class of precedence and resource constrained scheduling problems. Adv. Project Sched., 3–28 (1989)

  32. Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831–841 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  33. Van Den Akker, J.M., Hurkens, C.A.J., Savelsbergh, M.W.P.: Time-indexed formulations for machine scheduling problems: column generation. INFORMS J. Comput. 12(2), 111–124 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  34. Van den Akker, M., Hoogeveen, H., de Velde, S.: Combining column generation and Legrangean relaxation to solve a single-machine common due date problem. INFORMS J. Comput. 14(1), 37 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PYLO Research Group, Department of Industrial Engineering, Universidad de los Andes, Carrera 1E # 18-A-10, Bogotá, DC, Colombia

    Carlos Montoya

  2. LUNAM Université, Ecole des Mines de Nantes, IRCCyN, 4 rue Alfred Kastler, B.P. 20722, 44307 , Nantes Cedex 3, France

    Odile Bellenguez-Morineau

  3. LUNAM Université, Université Catholique de l’Ouest, LISA (EA CNRS 4094), 3 place André-Leroy, 49008 , Angers, France

    Eric Pinson & David Rivreau

Authors
  1. Carlos Montoya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Odile Bellenguez-Morineau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric Pinson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Rivreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlos Montoya.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Montoya, C., Bellenguez-Morineau, O., Pinson, E. et al. Branch-and-price approach for the multi-skill project scheduling problem. Optim Lett 8, 1721–1734 (2014). https://doi.org/10.1007/s11590-013-0692-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-013-0692-8

Keywords

Search

Navigation