COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS
DOI:
https://doi.org/10.9744/jti.3.1.9-17Keywords:
job shop, sequence dependent setup, Mixed Integer Programming, heuristic.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.Downloads
Download data is not yet available.
Downloads
Published
2004-07-02
How to Cite
[1]
I. G. A. Widyadana, “COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS”, J. Tek. Ind. J. Keilmuan dan Apl. Tek. Ind., vol. 3, no. 1, pp. 9–17, Jul. 2004.
Issue
Section
Articles
License
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a Creative Commons Attribution License (CC BY).
