COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS
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 b...
Main Author: | I Gede Agus Widyadana |
---|---|
Format: | Article |
Language: | English |
Published: |
Petra Christian University
2001-01-01
|
Series: | Jurnal Teknik Industri |
Subjects: | |
Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/15995 |
Similar Items
-
Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations
by: Fariborz Jolai, et al.
Published: (2013-06-01) -
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times
by: Mauricio Iwama Takano, et al.
Published: (2019-01-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
A Heuristic Rule Based on Complex Network for Open Shop Scheduling Problem With Sequence-Dependent Setup Times and Delivery Times
by: Zilong Zhuang, et al.
Published: (2019-01-01) -
Mixed integer lineal programming model to schedule flexible job-shop systems in make to order environments
by: Sebastián Enrique Ortiz Gaitán, et al.
Published: (2017-07-01)