Session

Mechatronics, System Engineering and Robotics

Description

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.

Keywords:

Job Shop Scheduling, Linear Programming, Optimization, Spreadsheet – Excel Solver

Session Chair

Peter Kopacek

Session Co-Chair

Thomas Duda

Proceedings Editor

Edmond Hajrizi

ISBN

978-9951-550-19-2

First Page

42

Last Page

48

Location

Pristina, Kosovo

Start Date

26-10-2019 11:00 AM

End Date

26-10-2019 12:30 PM

DOI

10.33107/ubt-ic.2019.148

Download

Included in

Engineering Commons

Share

COinS
 
Oct 26th, 11:00 AM Oct 26th, 12:30 PM

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

Pristina, Kosovo

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.