With the rapid development of economy and the intensification of market competition, project management involves various aspects of social development. The limitations of traditional project scheduling management meth...With the rapid development of economy and the intensification of market competition, project management involves various aspects of social development. The limitations of traditional project scheduling management methods are becoming more and more obvious. It is extremely urgent to create and apply new management technologies. According to the constraint theory, critical chain method is a method of controlling a project, which can greatly shorten the completion period of the project and reduce the cost of the enterprise. Firstly, the shortcomings of traditional project scheduling management methods are analyzed, and the importance of adopting key chain technology is pointed out. Secondly, the content of the basic chain method is summarized. Finally, the problems existing in the application of critical chain method are analyzed.展开更多
The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertai...The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.展开更多
To determine the reasonable resource dependent relations between activities for the purpose of exactly computing the total floats and the free floats of activities,correctly identifying critical activities and critica...To determine the reasonable resource dependent relations between activities for the purpose of exactly computing the total floats and the free floats of activities,correctly identifying critical activities and critical sequences in a project schedule with variable resource constraints,the concept of the minimal feasible set(MFS)is proposed and the properties of MFS are discussed.The methods to identify optimal MFSs and resource links are then studied.Furthermore,MFS is generalized to the situation that the preconditions of MFS are not satisfied.Contrastive results show that in establishing resource links and resolving floats,MFS is at least not inferior to other methods in all cases and is superior in most situations.展开更多
To solve the resource-constrained project scheduling problem(RCPSP),a hybrid ant colony optimization(HACO)approach is presented.To improve the quality of the schedules,the HACO is incorporated with an extended double ...To solve the resource-constrained project scheduling problem(RCPSP),a hybrid ant colony optimization(HACO)approach is presented.To improve the quality of the schedules,the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved.The HACO is tested on the set of large benchmark problems from the project scheduling problem library(PSPLIB).The computational result shows that the proposed algo-rithm can improve the quality of the schedules efficiently.展开更多
This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations amo...This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.展开更多
In order to minimize the project duration of resourceconstrained project scheduling problem( RCPSP), a gene expression programming-based scheduling rule( GEP-SR) method is proposed to automatically discover and select...In order to minimize the project duration of resourceconstrained project scheduling problem( RCPSP), a gene expression programming-based scheduling rule( GEP-SR) method is proposed to automatically discover and select the effective scheduling rules( SRs) which are constructed using the project status and attributes of the activities. SRs are represented by the chromosomes of GEP, and an improved parallel schedule generation scheme( IPSGS) is used to transform the SRs into explicit schedules. The framework of GEP-SR for RCPSP is designed,and the effectiveness of the GEP-SR approach is demonstrated by comparing with other methods on the same instances.展开更多
Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-lev...Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.展开更多
A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f...A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.展开更多
Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a r...Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a real project and production environment.To solve MS-RCPSP,it is an efficient method to use dispatching rules combined with a parallel scheduling mechanism to generate a scheduling scheme.This paper proposes an improved gene expression programming(IGEP)approach to explore newly dispatching rules that can broadly solve MS-RCPSP.A new backward traversal decoding mechanism,and several neighborhood operators are applied in IGEP.The backward traversal decoding mechanism dramatically reduces the space complexity in the decoding process,and improves the algorithm’s performance.Several neighborhood operators improve the exploration of the potential search space.The experiment takes the intelligent multi-objective project scheduling environment(iMOPSE)benchmark dataset as the training set and testing set of IGEP.Ten newly dispatching rules are discovered and extracted by IGEP,and eight out of ten are superior to other typical dispatching rules.展开更多
The resource constrained project scheduling problem (RCPSP) and a decision-making model based on multi-agent systems (MAS) and general equilibrium marketing are proposed. An algorithm leading to the resource allocatio...The resource constrained project scheduling problem (RCPSP) and a decision-making model based on multi-agent systems (MAS) and general equilibrium marketing are proposed. An algorithm leading to the resource allocation decision involved in RCPSP has also been developed. And this algorithm can be used in the multi-project scheduling field as well.Finally, an illustration is given.展开更多
The motivation for cost-effective management of highway pavements is evidenced not only by the massive expenditures associated with these activities at a national level but also by the consequences of poor pavement co...The motivation for cost-effective management of highway pavements is evidenced not only by the massive expenditures associated with these activities at a national level but also by the consequences of poor pavement condition on road users.This paper presents a state-of-the-art review of multi-objective optimization(MOO)problems that have been formulated and solution techniques that have been used in selecting and scheduling highway pavement rehabilitation and maintenance activities.First,the paper presents a taxonomy and hierarchy for these activities,the role of funding sources,and levels of jurisdiction.The paper then describes how three different decision mechanisms have been used in past research and practice for project selection and scheduling(historical practices,expert opinion,and explicit mathematical optimization)and identifies the pros and cons of each mechanism.The paper then focuses on the optimization mechanism and presents the types of optimization problems,formulations,and objectives that have been used in the literature.Next,the paper examines various solution algorithms and discusses issues related to their implementation.Finally,the paper identifies some barriers to implementing multi-objective optimization in selecting and scheduling highway pavement rehabilitation and maintenance activities,and makes recommendations to overcome some of these barriers.展开更多
This research aims at developing a new fuzzy activity finish time estimation model for project scheduling management.With the application of the fuzzy quality function deployment (FQFD) and fuzzy analytic hierarchy pr...This research aims at developing a new fuzzy activity finish time estimation model for project scheduling management.With the application of the fuzzy quality function deployment (FQFD) and fuzzy analytic hierarchy process (FAHP) methods,the degree of fuzziness for every project activity is calculated in accordance with considerations of project uncertainties.These uncertainties are measured by the risk level of such project-related characteristics as time limit,activity start time,budget,manpower,technological difficulty,and facility requirements.In this paper,rather than applying the de-fuzzification technique to obtain the crisp activity duration for project scheduling,the fuzzy finish time estimation method for every activity is proposed based on the degree of fuzziness.The corresponding fuzzy activity duration time plot is also developed in a new fuzzy Gantt chart.The proposed model can provide a reasonable fuzzy finish time estimation for every activity,while most scheduling methods only provide the finish time of the entire project.Compared to existing models,this time estimation model and its corresponding Gantt chart are predicted to have higher reliability and practical application in project management and scheduling.展开更多
The critical path method is one of the oldest and most important techniques used for planning and scheduling projects.The main objective of project management science is to determine the critical path through a networ...The critical path method is one of the oldest and most important techniques used for planning and scheduling projects.The main objective of project management science is to determine the critical path through a network representation of projects.The critical path through a network can be determined by many algorithms and is useful for managing,monitoring,and controlling the time and cost of an entire project.The essential problem in this case is that activity durations are uncertain;time presents considerable uncertainty because the time of an activity is not always easily or accurately estimated.This issue increases the need to use neutrosophic theory to solve the critical path problem.Real-world problems are characterized by a lack of precision,consistency,and completeness.The concept of neutrosophic sets has been introduced as a generalization of fuzzy,intuitionistic fuzzy,and crisp sets to overcome the ambiguity surrounding real-world problems.Truth-,falsity-,and indeterminacy-membership functions are used to express neutrosophic elements.This study was performed to examine a neutrosophic event-oriented algorithm for determining the critical path in activity-on-arc networks.The activity time estimates are presented as trapezoidal neutrosophic numbers,and score and accuracy functions are used to obtain a crisp model of the problem.An appropriate numerical example is then used to explain the proposed method.展开更多
This paper presents a new method to solve the resource-constrained project scheduling problem for software development. In this method,activity duration times are described as fuzzy variables and resource-constrained ...This paper presents a new method to solve the resource-constrained project scheduling problem for software development. In this method,activity duration times are described as fuzzy variables and resource-constrained software project scheduling problems are described as fuzzy programming models. First,how to model the software project scheduling problem under the fuzzy environment conditions is proposed. Second,in order to satisfy the different requirements of decision-making,two novel fuzzy project scheduling models,expected cost model and credibility maximization model,are suggested. Third,a hybrid intelligent algorithm integrated by genetic algorithm and fuzzy simulation is designed to solve the above two fuzzy programming models. Numerical experiments illustrate the effectiveness of the hybrid intelligent algorithm.展开更多
Offshore engineering construction projects are large and complex,having the characteristics of multiple execution modes andmultiple resource constraints.Their complex internal scheduling processes can be regarded as r...Offshore engineering construction projects are large and complex,having the characteristics of multiple execution modes andmultiple resource constraints.Their complex internal scheduling processes can be regarded as resourceconstrained project scheduling problems(RCPSPs).To solve RCPSP problems in offshore engineering construction more rapidly,a hybrid genetic algorithmwas established.To solve the defects of genetic algorithms,which easily fall into the local optimal solution,a local search operation was added to a genetic algorithm to defend the offspring after crossover/mutation.Then,an elitist strategy and adaptive operators were adopted to protect the generated optimal solutions,reduce the computation time and avoid premature convergence.A calibrated function method was used to cater to the roulette rules,and appropriate rules for encoding,decoding and crossover/mutation were designed.Finally,a simple network was designed and validated using the case study of a real offshore project.The performance of the genetic algorithmand a simulated annealing algorithmwas compared to validate the feasibility and effectiveness of the approach.展开更多
To solve the resource-constrained multiple project scheduling problem(RCMPSP) more effectively,a method based on timed colored Petri net(TCPN) was proposed.In this methodology,firstly a novel mapping mechanism between...To solve the resource-constrained multiple project scheduling problem(RCMPSP) more effectively,a method based on timed colored Petri net(TCPN) was proposed.In this methodology,firstly a novel mapping mechanism between traditional network diagram such as CPM(critical path method)/PERT(program evaluation and review technique) and TCPN was presented.Then a primary TCPN(PTCPN) for solving RCMPSP was modeled based on the proposed mapping mechanism.Meanwhile,the object PTCPN was used to simulate the multiple projects scheduling and to find the approximately optimal value of RCMPSP.Finally,the performance of the proposed approach for solving RCMPSP was validated by executing a mould manufacturing example.展开更多
The assumption of static and deterministic conditions is common in the practice of construction project planning. However, at the construction phase, projects are subject to uncertainty. This may lead to serious sched...The assumption of static and deterministic conditions is common in the practice of construction project planning. However, at the construction phase, projects are subject to uncertainty. This may lead to serious schedule disruptions and, as a consequence, serious revisions oft.he schedule baseline. The aim of the paper is developing a method for constructing robust project schedules with a proactive procedure. Robust project scheduling allows for constructing stable schedules with time buffers introduced to cope with multiple disruptions during project execution. The method proposed by the authors, based on Monte Carlo simulation technique and mathematical programming for buffer sizing optimization, was applied to scheduling an example project. The results were compared, in terms of schedule stability, to those of the float factor heuristic procedttre.展开更多
This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progre...This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.展开更多
文摘With the rapid development of economy and the intensification of market competition, project management involves various aspects of social development. The limitations of traditional project scheduling management methods are becoming more and more obvious. It is extremely urgent to create and apply new management technologies. According to the constraint theory, critical chain method is a method of controlling a project, which can greatly shorten the completion period of the project and reduce the cost of the enterprise. Firstly, the shortcomings of traditional project scheduling management methods are analyzed, and the importance of adopting key chain technology is pointed out. Secondly, the content of the basic chain method is summarized. Finally, the problems existing in the application of critical chain method are analyzed.
文摘The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.
基金supported partly by the Postdoctoral Science Foundation of China(2007042-0922)the Program of Educational Commission of Guangxi Zhuang Minority Autonomous Region(200712LX128)the Scientific Research Foundation of Guangxi University for Nationalities for Talent Introduction(200702YZ01).
文摘To determine the reasonable resource dependent relations between activities for the purpose of exactly computing the total floats and the free floats of activities,correctly identifying critical activities and critical sequences in a project schedule with variable resource constraints,the concept of the minimal feasible set(MFS)is proposed and the properties of MFS are discussed.The methods to identify optimal MFSs and resource links are then studied.Furthermore,MFS is generalized to the situation that the preconditions of MFS are not satisfied.Contrastive results show that in establishing resource links and resolving floats,MFS is at least not inferior to other methods in all cases and is superior in most situations.
基金supported by Liaoning BaiQianWan Talents Program(20071866-25)
文摘To solve the resource-constrained project scheduling problem(RCPSP),a hybrid ant colony optimization(HACO)approach is presented.To improve the quality of the schedules,the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved.The HACO is tested on the set of large benchmark problems from the project scheduling problem library(PSPLIB).The computational result shows that the proposed algo-rithm can improve the quality of the schedules efficiently.
基金supported by the National Natural Science Foundation of China(7120116671201170)
文摘This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.
基金The Spring Plan of Ministry of Education,China(No.Z2012017)
文摘In order to minimize the project duration of resourceconstrained project scheduling problem( RCPSP), a gene expression programming-based scheduling rule( GEP-SR) method is proposed to automatically discover and select the effective scheduling rules( SRs) which are constructed using the project status and attributes of the activities. SRs are represented by the chromosomes of GEP, and an improved parallel schedule generation scheme( IPSGS) is used to transform the SRs into explicit schedules. The framework of GEP-SR for RCPSP is designed,and the effectiveness of the GEP-SR approach is demonstrated by comparing with other methods on the same instances.
基金the National Basic Research Program (973 Program) (2002CB312200)
文摘Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.
基金supported by the National Natural Science Foundation of China(71171038)
文摘A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.
基金funded by the National Natural Science Foundation of China(Nos.51875420,51875421,52275504).
文摘Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a real project and production environment.To solve MS-RCPSP,it is an efficient method to use dispatching rules combined with a parallel scheduling mechanism to generate a scheduling scheme.This paper proposes an improved gene expression programming(IGEP)approach to explore newly dispatching rules that can broadly solve MS-RCPSP.A new backward traversal decoding mechanism,and several neighborhood operators are applied in IGEP.The backward traversal decoding mechanism dramatically reduces the space complexity in the decoding process,and improves the algorithm’s performance.Several neighborhood operators improve the exploration of the potential search space.The experiment takes the intelligent multi-objective project scheduling environment(iMOPSE)benchmark dataset as the training set and testing set of IGEP.Ten newly dispatching rules are discovered and extracted by IGEP,and eight out of ten are superior to other typical dispatching rules.
文摘The resource constrained project scheduling problem (RCPSP) and a decision-making model based on multi-agent systems (MAS) and general equilibrium marketing are proposed. An algorithm leading to the resource allocation decision involved in RCPSP has also been developed. And this algorithm can be used in the multi-project scheduling field as well.Finally, an illustration is given.
基金This work is supported by the Next Generation Transportation Systems Center(NEXTRANS),USDOT's Region 5 University Transportation CenterThe work is also affiliated with Purdue University College of Engineering's Institute for Control,Optimization,and Networks(ICON)and Center for Intelligent Infrastructure(CII)initiatives.
文摘The motivation for cost-effective management of highway pavements is evidenced not only by the massive expenditures associated with these activities at a national level but also by the consequences of poor pavement condition on road users.This paper presents a state-of-the-art review of multi-objective optimization(MOO)problems that have been formulated and solution techniques that have been used in selecting and scheduling highway pavement rehabilitation and maintenance activities.First,the paper presents a taxonomy and hierarchy for these activities,the role of funding sources,and levels of jurisdiction.The paper then describes how three different decision mechanisms have been used in past research and practice for project selection and scheduling(historical practices,expert opinion,and explicit mathematical optimization)and identifies the pros and cons of each mechanism.The paper then focuses on the optimization mechanism and presents the types of optimization problems,formulations,and objectives that have been used in the literature.Next,the paper examines various solution algorithms and discusses issues related to their implementation.Finally,the paper identifies some barriers to implementing multi-objective optimization in selecting and scheduling highway pavement rehabilitation and maintenance activities,and makes recommendations to overcome some of these barriers.
文摘This research aims at developing a new fuzzy activity finish time estimation model for project scheduling management.With the application of the fuzzy quality function deployment (FQFD) and fuzzy analytic hierarchy process (FAHP) methods,the degree of fuzziness for every project activity is calculated in accordance with considerations of project uncertainties.These uncertainties are measured by the risk level of such project-related characteristics as time limit,activity start time,budget,manpower,technological difficulty,and facility requirements.In this paper,rather than applying the de-fuzzification technique to obtain the crisp activity duration for project scheduling,the fuzzy finish time estimation method for every activity is proposed based on the degree of fuzziness.The corresponding fuzzy activity duration time plot is also developed in a new fuzzy Gantt chart.The proposed model can provide a reasonable fuzzy finish time estimation for every activity,while most scheduling methods only provide the finish time of the entire project.Compared to existing models,this time estimation model and its corresponding Gantt chart are predicted to have higher reliability and practical application in project management and scheduling.
基金This work was supported by the Soonchunhyang University Research Fund.
文摘The critical path method is one of the oldest and most important techniques used for planning and scheduling projects.The main objective of project management science is to determine the critical path through a network representation of projects.The critical path through a network can be determined by many algorithms and is useful for managing,monitoring,and controlling the time and cost of an entire project.The essential problem in this case is that activity durations are uncertain;time presents considerable uncertainty because the time of an activity is not always easily or accurately estimated.This issue increases the need to use neutrosophic theory to solve the critical path problem.Real-world problems are characterized by a lack of precision,consistency,and completeness.The concept of neutrosophic sets has been introduced as a generalization of fuzzy,intuitionistic fuzzy,and crisp sets to overcome the ambiguity surrounding real-world problems.Truth-,falsity-,and indeterminacy-membership functions are used to express neutrosophic elements.This study was performed to examine a neutrosophic event-oriented algorithm for determining the critical path in activity-on-arc networks.The activity time estimates are presented as trapezoidal neutrosophic numbers,and score and accuracy functions are used to obtain a crisp model of the problem.An appropriate numerical example is then used to explain the proposed method.
基金Supported by the National Natural Science Foundation of China (60975050)the Specialized Research Fund for the Doctoral Program of Higher Education of China (20070486081)
文摘This paper presents a new method to solve the resource-constrained project scheduling problem for software development. In this method,activity duration times are described as fuzzy variables and resource-constrained software project scheduling problems are described as fuzzy programming models. First,how to model the software project scheduling problem under the fuzzy environment conditions is proposed. Second,in order to satisfy the different requirements of decision-making,two novel fuzzy project scheduling models,expected cost model and credibility maximization model,are suggested. Third,a hybrid intelligent algorithm integrated by genetic algorithm and fuzzy simulation is designed to solve the above two fuzzy programming models. Numerical experiments illustrate the effectiveness of the hybrid intelligent algorithm.
基金funded by the Ministry of Industry and Information Technology of the People’s Republic of China(Nos.[2018]473,[2019]331).
文摘Offshore engineering construction projects are large and complex,having the characteristics of multiple execution modes andmultiple resource constraints.Their complex internal scheduling processes can be regarded as resourceconstrained project scheduling problems(RCPSPs).To solve RCPSP problems in offshore engineering construction more rapidly,a hybrid genetic algorithmwas established.To solve the defects of genetic algorithms,which easily fall into the local optimal solution,a local search operation was added to a genetic algorithm to defend the offspring after crossover/mutation.Then,an elitist strategy and adaptive operators were adopted to protect the generated optimal solutions,reduce the computation time and avoid premature convergence.A calibrated function method was used to cater to the roulette rules,and appropriate rules for encoding,decoding and crossover/mutation were designed.Finally,a simple network was designed and validated using the case study of a real offshore project.The performance of the genetic algorithmand a simulated annealing algorithmwas compared to validate the feasibility and effectiveness of the approach.
文摘To solve the resource-constrained multiple project scheduling problem(RCMPSP) more effectively,a method based on timed colored Petri net(TCPN) was proposed.In this methodology,firstly a novel mapping mechanism between traditional network diagram such as CPM(critical path method)/PERT(program evaluation and review technique) and TCPN was presented.Then a primary TCPN(PTCPN) for solving RCMPSP was modeled based on the proposed mapping mechanism.Meanwhile,the object PTCPN was used to simulate the multiple projects scheduling and to find the approximately optimal value of RCMPSP.Finally,the performance of the proposed approach for solving RCMPSP was validated by executing a mould manufacturing example.
文摘The assumption of static and deterministic conditions is common in the practice of construction project planning. However, at the construction phase, projects are subject to uncertainty. This may lead to serious schedule disruptions and, as a consequence, serious revisions oft.he schedule baseline. The aim of the paper is developing a method for constructing robust project schedules with a proactive procedure. Robust project scheduling allows for constructing stable schedules with time buffers introduced to cope with multiple disruptions during project execution. The method proposed by the authors, based on Monte Carlo simulation technique and mathematical programming for buffer sizing optimization, was applied to scheduling an example project. The results were compared, in terms of schedule stability, to those of the float factor heuristic procedttre.
文摘This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.
