To extend the form of process constraints, this paper discusses coupling constraints flexible job shop scheduling problem modeling and scheduling algorithm designing. At the basis of coupling constraint modeling by using formal and graphical presentation of flexible job shop scheduling problem, the paper designs coupling constraints neighborhood structure by selecting the execution steps of taboo search algorithm. Subsequently, the paper verifies applicability and quality of algorithm through coupling constraints example and Brandimarte test date. The research of the coupling constraint modeling and scheduling algorithm designing can provide the solution of multiple components systems scheduling and widens consideration of the research on job shop correlated problem.