Jurnal Teknik Industri
Vol. 3 No. 1 (2001): JUNE 2001

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

I Gede Agus Widyadana (Faculty of Industrial Technology, Petra Christian University)

Article Info

Publish Date
02 Jul 2004

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.

Copyrights © 2001




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
49.956 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Teknik Industri
Website

Abbrev

ind

Publisher

Universitas Kristen Petra Surabaya

Subject

Industrial & Manufacturing Engineering

Description

Jurnal Teknik Industri aims to: Promote a comprehensive approach to the application of industrial engineering in industries as well as incorporating viewpoints of different disciplines in industrial engineering. Strengthen academic exchange with other institutions. Encourage scientist, practicing ...