DOI: https://doi.org/10.9744/jti.3.1.pp.%209-17

COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS

I Gede Agus Widyadana

Abstract


The decisions to choose appropriate tools for solving industrial problems are not just tools that achieve optimal solution only but it should consider computation time too. One of industrial problems that still difficult to achieve both criteria is scheduling problem. This paper discuss comparison between mixed integer programming which result optimal solution and heuristic method to solve job shop scheduling problem with separable sequence-dependent setup. The problems are generated and the result shows that the heuristic methods still cannot satisfy optimal solution.

Keywords


job shop, sequence dependent setup, Mixed Integer Programming, heuristic.

Full Text:

PDF


DOI: https://doi.org/10.9744/jti.3.1.pp.%209-17



Instructions for Preparing Papers for JTI.docx
Panduan untuk Menulis di JTI.docx

The Journal is published by The Institute of Research & Community Outreach - Petra Christian University. It available online supported by Directorate General of Higher Education - Ministry of National Education - Republic of Indonesia.

©All right reserved 2016.Jurnal Teknik Industri, ISSN: 1411-2485, e-ISSN: 2087-7439

shopify traffic stats
View My Stats