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.

Creator(s)

• (96-007) I Gede Agus Widyadana

Contributor(s)

-

Publisher

Universitas Kristen Petra; 2001

Language

English

Category

jou – Journal

Sub Category

-

Source

Jurnal Teknik Industri Vol. 3, No. 1, Juni 2001: 9 - 17; I Gede Agus Widyadana (96-007)

Subject(s)

• SCHEDULING

File(s)

• jiunkpe-ns-jou-2001-96-007-3188-job_shop-resource1.pdf