An optimization approach and a model for Job Shop Scheduling Problem with Linear Programming

Optimization approaches and models are developed for job shop scheduling problems over the last decades, particularly the most attempts have been done in industry and considerable progress has been made on an academic line. The Job-shop scheduling considered the most significant industrial activities, mostly in manufacturing. The JSSP (Job Shop Scheduling Problems) is typical NP-hard problem. To solve this problem, we have used the linear programming approach. Real data have been taken from the company of the metalworking industry. The model has been created, then it was analyzed using Spreadsheet – Excel Solver. The appropriate sequence has been obtained and the results shown that it is possible to achieve the minimum completion time compared to other sequence combination