This paper focuses on the study of job-shop problems with transportation, blocking and no-wait (BNWT JSSP). This problem is an extension of the job shop problem. We take into account transport operations of jobs between different machines using a limited number of robots. We also have blocking and no wait constraints. It means that after a completion of an operation, a job waits on its machine, thus blocking it, until the next machine and a robot are available. In the other hand, the job starts its processing on the machine immediately and without any interruption after the robot has accomplished the transportation operation, thus no wait constraints. The aim of our problem is to find a feasible order of machine operations and transport operations. Additionally to the problem description, we will present a method based on graph theory which illustrates blocking situations. As the main contribution, we will formalize this problem with an integer linear programming models and propose an heuristic based on priority rules.