Research Of The Resource-constrained Project Scheduling Problem Based On P System

Membrane computing,also known as P system,is a new branch of natural computing whose aim is to abstract computing ideas from the the structure and the function of living cells,as well as from cell tissues and organs.The new natural computing model has characterizations of Turing completeness,maximal parallelism and distributed manner.The new computing model has been widely applied to practical problems of intelligent robot,biology,data mining,cryptography,economics and so on.Membrane computing is a promising area of research,and is expected to play a key role in the era of big data.Theoretically,some simple P systems has been proved that it has Turing completeness,given its powerful parallel computing capabilities,P system can surpass and replace the Turing machine.Therefore,the study of P system has received researchers' wide attention.The project-oriented organization is now common,project management is a skill required of all managers.Project scheduling problem is an important component of project time management,it has received researchers' wide attention.And the resource-constrained project scheduling problem is a NP-hard problem.With the increase of the number of activities and the number of resources,the computational complexity of the problem increases rapidly.It is hard to calculate the problem in reasonable time.Thus,using new algorithm to solve the problem more efficiently has received researchers' wide attention.In this paper,based on the maximal parallelism of P system,we extend the application of the P system to resource-constrained project scheduling problem in order to solve the problem more efficiently.The main work of this paper: Firstly,cooperating cell-like P systems(CCP)were proposed,a simple example of this P system was given,and Turing universality was reached for CCP;secondly,the P system for solving RCPSP based on serial schedule generation scheme was proposed,which was a new attempt of application of P system,the structure of the P system,the rules and the objects were proposed,and the feasibility of the P system was provedby an example of case;thirdly,the P system for solving RCPSP based on GA was proposed,the effectiveness of the algorithm was proved by the cases from PSPLIB;finally,the P system for solving multi-mode resource-constrained project scheduling problem(MRCPSP)based on GA was proposed,the effectiveness of the algorithm was proved by the cases from PSPLIB.