Toward a scalable type-2 fuzzy model for resource-constrained project scheduling problem

https://doi.org/10.1016/j.asoc.2020.106988Get rights and content

Highlights

  • A new solution for RCPSP under uncertain activity time span.

  • A scalable type-2 fuzzy Dijkstra algorithm and simplex algorithm.

  • Run-time optimization using type-2 fuzzy simplex algorithm.

  • Different permutation in type-2 Dijkstra algorithm.

  • The largest cover of uncertainty through type-2 fuzzy.

Abstract

This paper develops a scalable method for the Resource-Constrained Project Scheduling Problem (RCPSP) with a type-2 fuzzy uncertain activity time-span. The objective of this method is the project completion time minimization. This problem has been solved through a scalable type-2 fuzzy Dijkstra algorithm inside different activities rules. The Dijkstra algorithm produces a different permutation of activities alongside each selected path that should be examined in optimization function using the type-2 fuzzy simplex algorithm. This method generates the best permutation using run-time optimization which significantly satisfies lower project completion time inside the project cost minimization. Also, the method proposed a resource workload for both tactical and operational levels of planning. The presented approach is conducted by the gas-related industry project and a case on satellite design of the aerospace industry on 3 different Resource/Process/Environment strategies. The results convey the defined method has a better performance compared to type-1 fuzzy for covering the largest uncertainty domain. This method could be considered in every engineering project management.

Introduction

The RCPSP is classic and well-known research that minimizes the project completion time [1], [2], [3]. In general, project scheduling with precedencies and resource limitations is in the category of the NP-hard problem [4]. This standard version includes activities scheduling with different essential renewable resources [3]. Also, resources are available in limited quantities and each activity has a known time-span with a constant quantity of resources [5]. There are different extensions of RCPSP such as generalized precedence relations, multiple objective, uncertain parameters, and multi-mode activity. In all extensions, each activity must be implemented and all of them besides the precedence constraints are known [3], [6]. Thus, there are different solutions to RCPSP which have been illustrated in Fig. 1 as the taxonomy for solving methods [7], [8]. The proposed solution of this paper can be classified as a combined method of exact solution (Mathematical programming) and heuristic one (Search based).

In this case, many types of research have determined heuristic approaches for solving the RCPSP but often need a huge computational effort to solve problems [9]. Most of the researches in RCPSP has been done in a static environment [7] but due to the dynamic nature of the environment, project scheduling may be subject to considerable uncertainties [2], [10]. These uncertainties are as following [10]:

  • Uncertainties in activities,

  • Uncertainties in resources demand,

  • Temporal uncertainties.

Therefore, effectively dealing with the RCPSP solving method with these uncertainties is becoming an important challenge for managers [9].

Identified the crucial of developing a new approach, the authors focus on the type-2 fuzzy version of the RCPSP in this study and assume activity time-span is an uncertain variable. The reason for activity time-span parameter consideration in uncertain conditions is that the varying in activity time-span present difficult management of activity execution. Thus, confusion in activity execution may cause project delay, higher project cost, and resource insufficiency [3]. Thus, for solving this problem, the main research question is as following:

(RQ) How can we cover this uncertainty level of scheduling?

To address the RCPSP under uncertain activity time-span, the scalable type-2 fuzzy approach is formed based on the following research stages:

  • Identify the network of the project,

  • Identify precedence constraints of each activity,

  • Identify resource constraints of each activity,

  • Appropriate settings such as activity time-span in type-2 fuzzy version,

  • Identify the priority of activities,

  • Calculate the best path of activities execution via scalable type2-fuzzy Dijkstra algorithm.

The proposed method was conducted by two case studies, one in a gas-related industry and a case on the aerospace industry. The presented approach has handled the projects on 3 different Resource/Process/Environment strategies. Due to the wide range of uncertainty and complexity of such projects, a scalable type-2 Fuzzy model has been used for handling projects dimension. In the cases of this paper both for the gas industry and for the satellite design development, uncertainty and risk are an integral part of the projects. Section 5 indicates applying the proposed method for the uncertainty handling of high-tech project management. The proposed method has better results and covers a larger range of uncertainty and also minimizes project execution time. The solution method with a combination of type-2 simplex algorithm and the type-2 fuzzy Dijkstra algorithm provides the most optimal path to perform activities.

The novelty of the paper includes two important issues in project management, as follows:

A—The first novelty in problem formulation includes the use of triangular, trapezoidal membership functions, etc., as scalable fuzzy which can strengthen the effectiveness of dealing with uncertainty. In other words, the proposed method has better results and covers a larger range of uncertainty and also minimizes project execution time compared with traditional ones.

B—The second contribution of the paper is based on the solution method. The combination of the Simplex algorithm and the type-2 fuzzy Dijkstra algorithm provides the most optimal path to perform activities in a wide range of uncertainty-based projects.

This paper has been organized as follows: Section 2 presents the literature review. Section 3 gives a brief introduction to the basic theory of type-2 fuzzy in the proposed algorithm. Section 4 presents a formal description of the algorithm. Section 5 validates the illustrated method by two case studies in the gas-related and aerospace industry. Finally, Section 6, presents the conclusion.

Section snippets

Literature review

In this section, the literature of Project management, Resource-Constrained Project Scheduling Problem, and Type-2 fuzzy applications are elaborated, respectively.

Type-2 fuzzy numbers

In type-2 fuzzy, each membership cannot be defined as 0 or 1. Also, in the hard conditions of the membership definition, type-2 fuzzy can be defined [34], [35], [36], [37].

The formal description of the proposed method

The Dijkstra algorithm introduces the shortest path to the project based on the weight of the edges. In this study, the weight of the edges is determined based on their priority and importance. Then, the optimization of the selected permutations is determined by using the permutation in the target functions and solving the function with the type-2 fuzzy Simplex algorithm. If the selected path optimizes the objective function, it is an optimal path, otherwise, another alternative is selected. To

Proposed method validation

This section includes two cases; one in the area of gas-related industry, another in the area of aerospace industry, and finally comparative analysis:

Conclusion

This research proposed a scalable type-2 fuzzy Dijkstra algorithm for the RCPSP with uncertain activity time-span and uncertain resource demand. It uses the Dijkstra algorithm concept which employs different priorities of activities to construct feasible scheduling. Type-2 fuzzy Dijkstra algorithm produces a different permutation of activities and then each selected path should be tested in optimization function using the type-2 fuzzy Simplex algorithm. Also, the method presented a resource

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Amirhosein Mahdavi is the master student of Industrial Engineering at Mazandaran University of Science and Technology, Babol, Iran. His research interests include project management.

References (41)

Cited by (8)

  • Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time

    2022, Swarm and Evolutionary Computation
    Citation Excerpt :

    Although calculating T2FPT consumes more time than TFN, it is proved more accurate than TFN [35]. It is worth noting that T2FPT has already been applied for scheduling problems such as resource-constrained project scheduling problem [36], flexible job shop problem [37] and distributed hybrid flow shop scheduling problem [33]. However, to the best of our knowledge, the current researches for DFJSP are mainly about certain processing time, which is an ideal production environment.

  • An advanced TOPSIS method with new fuzzy metric based on interval type-2 fuzzy sets

    2021, Expert Systems with Applications
    Citation Excerpt :

    Kaya and Aycin (2021) applied IT2FNs to a combined methodology of AHP and COPRAS-G (Complex Proportional Assessment of alternatives with Grey relations) for an application on supplier selection in Industry 4.0. Mahdavi et al. (2021) benefitted from T2FSs for a task scheduling problem. Meniz et al. (2021) utilized from multilevel AHP (Analytic Hierarchy Process) method based on interval T2FSs in a portfolio selection problem and have shown that the T2FSs are superior to the type-1 fuzzy sets.

View all citing articles on Scopus

Amirhosein Mahdavi is the master student of Industrial Engineering at Mazandaran University of Science and Technology, Babol, Iran. His research interests include project management.

Babak Shirazi is the associate professor of Industrial Engineering at Mazandaran University of Science and Technology, Babol, Iran. He studied Computer Engineering in Tehran University from 1996 to 2000. He has graduated in M.Sc. and Ph.D. of industrial engineering from Mazandaran University of Science and Technology, Babol, Iran, in 2005 and 2010, respectively. His research interests include simulation modeling in manufacturing system and supply chain management, Enterprise Architecture, and industrial enterprise development strategy setting. He has published over 85 research papers. He authored a book in enterprise resources planning in Persian.

Javad Rezaeian is the associate professor of Industrial Engineering at Mazandaran University of Science and Technology, Babol, Iran. He studied Industrial Engineering at Yazd University of Technology. His research interests include integrated simulation and metaheuristic methods in the public business process. He has published over 60 research papers.

View full text