The Job-Shop Scheduling Problem (JSSP) attracted a lot of researchers from various research disciplines, mainly operations research, management science, computer science, and manufacture science for the last 50 years. JSSP is a typical NP-hard problem in the strong sense. Although the literature is full of researches concerning the JSSP, practitioners are not able to get benefit of the majority of these researches because of the assumptions which take the problem very far away from the real life JSSP. The authors’ are to build a simulation model for the JSSP to be able to relax some of these assumptions to simulate the real life JSSP.