New procedures with new activity assumptions for solving resource constrained project scheduling problems

Issa, S.; Tu, Y.

Growing Science » Journal of Project Management » New procedures with new activity assumptions for solving resource constrained project scheduling problems

Journals

JPM Volumes

Volume 1 (8)
- Issue 1 (5)
- Issue 2 (3)

Volume 2 (13)
- Issue 1 (4)
- Issue 2 (3)
- Issue 3 (3)
- Issue 4 (3)

Volume 3 (17)
- Issue 1 (4)
- Issue 2 (5)
- Issue 3 (4)
- Issue 4 (4)

Volume 4 (24)
- Issue 1 (4)
- Issue 2 (8)
- Issue 3 (8)
- Issue 4 (4)

Volume 5 (20)
- Issue 1 (5)
- Issue 2 (5)
- Issue 3 (5)
- Issue 4 (5)

Volume 6 (20)
- Issue 1 (5)
- Issue 2 (5)
- Issue 3 (5)
- Issue 4 (5)

Volume 7 (21)
- Issue 1 (5)
- Issue 2 (5)
- Issue 3 (5)
- Issue 4 (6)

Volume 8 (21)
- Issue 1 (6)
- Issue 2 (5)
- Issue 3 (5)
- Issue 4 (5)

Volume 9 (35)
- Issue 1 (6)
- Issue 2 (5)
- Issue 3 (9)
- Issue 4 (15)

Volume 10 (15)
- Issue 1 (15)

Countries

Journal of Project Management

ISSN 2371-8374 (Online) - ISSN 2371-8366 (Print) Quarterly Publication Volume 5 Issue 1 pp. 41-58 , 2020

New procedures with new activity assumptions for solving resource constrained project scheduling problems Pages 41-58 Download PDF

Authors: Samer Ben Issa, Yiliu Tu

DOI: 10.5267/j.jpm.2019.7.002

Keywords: Project scheduling, Limited multi-resource, ABCD activity classifications, Flexible resource profile

Abstract: The resource-constrained project scheduling problem (RCPSP) is a well-known and widely studied topic. The underlying problem assumes that non-preemptions and that constant resources are restrictions imposed on project activities, which are to be scheduled, subject to precedence relation and limited resource constraints. Project activities, in RCPSP, are classified under category A. The problem is expanded to include various other activity assumptions categories, such as B and C. In the Preemptive-RCPSP, project activities are classified under category B, which refers to the activity that can be implemented using constant resources and constant durations. In the Flexible-RCPSP, project activities are classified under category C, which refers to the activities that can be executed using flexible resources over flexible durations, and preemptions are not allowed. However, in One-of-a-Kind Production companies (OKP), such as the housing industry, plastic injection moldings, and RV manufacturing, all known as “manufactured-to-order” operations, the activities are classified under category D in addition to A, B, and C, simultaneously. Category D refers to the activities that can be executed using flexible durations and flexible resources, and preemptions are allowed. In this paper, therefore, we present a new effective model in order to deal with the projects that consist of all the previous activity assumptions simultaneously to generate feasible project schedules. Case studies are included, and the results show that the resources usage is increased and the project makespan is reduced.

How to cite this paper

 Issa, S & Tu, Y. (2020). New procedures with new activity assumptions for solving resource constrained project scheduling problems.Journal of Project Management, 5(1), 41-58.

Refrences

Afshar-Nadjafi, B. (2018). A solution procedure for preemptive multi-mode project scheduling problem with mode changeability to resumption. Applied Computing and Informatics, 14(2), 192-201.
Baumann, P., & Trautmann, N. (2013). Optimal scheduling of work-content-constrained projects. In 2013 IEEE International Conference on Industrial Engineering and Engineering Manage-ment (pp. 395-399). IEEE.
Bianco, L., Caramia, M., & Dell’Olmo, P. (1999). Solving a preemptive project scheduling prob-lem with coloring techniques. In Project Scheduling (pp. 135-145). Springer, Boston, MA.
Bianco, L., & Caramia, M. (2013). A new formulation for the project scheduling problem under limited resources. Flexible Services and Manufacturing Journal, 25(1-2), 6-24.
Brucker, P., & Knust, S. (2000, August). Resource-constrained project scheduling and timeta-bling. In International Conference on the Practice and Theory of Automated Timetabling (pp. 277-293). Springer, Berlin, Heidelberg.
Buddhakulsomsiri, J., & Kim, D. S. (2006). Properties of multi-mode resource-constrained pro-ject scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 175(1), 279-295.
Buddhakulsomsiri, J., & Kim, D. S. (2007). Priority rule-based heuristic for multi-mode re-source-constrained project scheduling problems with resource vacations and activity split-ting. European Journal of Operational Research, 178(2), 374-390.
Cheng, J., Fowler, J., Kempf, K., & Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Re-search, 53, 275-287.
Colak, S., Agarwal, A., & Erenguc, S. (2013). Multi-mode resource-constrained project-scheduling problem with renewable resources: new solution approaches. Journal of Business & Economics Research (Online), 11(11), 455.
Damay, J., Quilliot, A., & Sanlaville, E. (2007). Linear programming-based algorithms for preemptive and non-preemptive RCPSP. European Journal of Operational Research, 182(3), 1012-1022.
Demeulemeester, E. L., & Herroelen, W. S. (1996). An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Opera-tional Research, 90(2), 334-348.
Elsayed, S., Sarker, R., Ray, T., & Coello, C. C. (2017). Consolidated optimization algorithm for resource-constrained project scheduling problems. Information Sciences, 418, 346-362.
Fang, C., & Wang, L. (2012). An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Computers & Operations Research, 39(5), 890-901.
Fündeling, C. U., & Trautmann, N. (2010). A priority-rule method for project scheduling with work-content constraints. European Journal of Operational Research, 203(3), 568-574.
Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of operational research, 207(1), 1-14.
Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Re-search, 127(2), 394-407.
Issa, S., & Tu, Y. (2017). Integrated multi-resource planning and scheduling in an engineering project. Journal of Project Management, 2(1), 11-26.
Kellenbrink, C., & Helber, S. (2015). Scheduling resource-constrained projects with a flexible project structure. European Journal of Operational Research, 246(2), 379-391.
Kolisch, R., & Hartmann, S. (1999). Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. In Project scheduling (pp. 147-178). Springer, Boston, MA.
Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European journal of operational research, 174(1), 23-37.
Sprecher, A., & Kolisch, R. (1996). PSPLIB—a project scheduling problem library. Eur. J. Oper. Res, 96, 205-216.
Ma, W., Che, Y., Huang, H., & Ke, H. (2016). Resource-constrained project scheduling problem with uncertain durations and renewable resources. International journal of machine learning and cybernetics, 7(4), 613-621.
Naber, A. (2017). Resource-constrained project scheduling with flexible resource profiles in con-tinuous time. Computers & Operations Research, 84, 33-45.
Naber, A., & Kolisch, R. (2014). MIP models for resource-constrained project scheduling with flexible resource profiles. European Journal of Operational Research, 239(2), 335-348.
Nudtasomboon, N., & Randhawa, S. U. (1997). Resource-constrained project scheduling with re-newable and non-renewable resources and time-resource tradeoffs. Computers & Industrial Engineering, 32(1), 227-242.
Oztemel, E., & Selam, A. A. (2017). Bees Algorithm for multi-mode, resource-constrained pro-ject scheduling in molding industry. Computers & Industrial Engineering, 112, 187-196.
Ranjbar, M., & Kianfar, F. (2010). Resource-constrained project scheduling problem with flexi-ble work profiles: a genetic algorithm approach. Scientia Iranica. Transaction E, Industrial Engineering, 17(1), 25.
Tao, S., & Dong, Z. S. (2018). Multi-mode resource-constrained project scheduling problem with alternative project structures. Computers & Industrial Engineering, 125, 333-347.
Tritschler, M., Naber, A., & Kolisch, R. (2017). A hybrid metaheuristic for resource-constrained project scheduling with flexible resource profiles. European Journal of Operational Re-search, 262(1), 262-273.
Tu, Y., & Dean, P. (2011). One-of-a-kind Production. Springer Science & Business Media.
Valls, V., Laguna, M., Lino, P., Pérez, A., & Quintanilla, S. (1999). Project scheduling with sto-chastic activity interruptions. Project scheduling (pp. 333-353). Springer, Boston, MA.
Vanhoucke, M., & Coelho, J. (2018). A tool to test and validate algorithms for the resource-constrained project scheduling problem. Computers & Industrial Engineering, 118, 251-265.
Van Peteghem, V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409-418.
Van Peteghem, V., & Vanhoucke, M. (2014). An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instanc-es. European Journal of Operational Research, 235(1), 62-72.
Zhang, H., Li, H., & Tam, C. M. (2006). Particle swarm optimization for resource-constrained project scheduling. International Journal of Project Management, 24(1), 83-92.