According to the special characteristics of job shop mode facing to network cooperative manufacture, the scheduled goal can be decomposed in a parallel way. And the definitions of 'Finish No Late Than' time constraint Cfnlt, the 'Start No Late Than' time constraint Csnlt, goal chain constraint Cchain and goal chain Gchain were proposed. Based on such constraints, competitions of material resources and equipment resources when coordinating multiple goals were analyzed. And a simple algorithm based on priority constraints was brought out. It can solve the Job Shop schedule problems efficiency.
