Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/394812| Title: | A branch and bound algorithm in optimizing job shop scheduling problems |
| Authors: | Erna Budhiarti Nababan Salwani Abdullah Abdul Razak Hamdan Mohamad Shanudin Zakaria |
| Conference Name: | International Symposium on Information Technology 2008 |
| Keywords: | Branch and bound algorithm Job shop scheduling problem Branch and bound method B&B method |
| Conference Date: | 26/08/2008 |
| Conference Location: | Kuala Lumpur Convention Centre, Malaysia |
| Abstract: | One primary objective in solving the job shop scheduling problems is to minimize the makespan, which is a particularly hard combinatorial optimization problem. The problem has been known for years and a vast majority of researches had been focused to solve the problem using a variety of optimization methods such as the branch and bound (B&B). However, the B&B method is considered as only suitable for small and medium size problems due its prohibitive computational time. In this paper, we implement the B&B method using the disjunctive programming approach to obtain optimal solutions for job shop scheduling problem. The B&B program developed is tested on a set of benchmark data and the results obtain are compared to best known from the previous work. Based on the comparison, we conclude that the branch and bound algorithm is considerable as a solution tool for small, medium, as well as large job shop problems. |
| Pages: | 5 |
| Call Number: | T58.5.C634 2008 kat sem |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE),Piscataway, USA |
| Appears in Collections: | Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.