Solving Job Shop Scheduling Problems by P System with Active Membranes

This paper focuses on the joint study of membrane computing with job shop scheduling problem. We use membrane to conduct the whole process of computation, which can obtain all possible combinations of operations and machines by evolution rules and calculate the whole computing time by communication rules, complete the order of every artifacts, output the final result through communication rules and division rules. A 3*3 JSSP example is used to indicate the feasibility of the provided algorithm.