Universiti Teknologi Malaysia Institutional Repository

A branch and bound and simulated annealing approach for job shop scheduling

Tan, Hui Woon and Salim, Sutinah (2004) A branch and bound and simulated annealing approach for job shop scheduling. Matematika, 20 (1). pp. 1-17. ISSN 0127-8274

[img]
Preview
PDF
255Kb

Official URL: http://www.fs.utm.my/matematika/content/view/92/31

Abstract

This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan.

Item Type:Article
Uncontrolled Keywords:job shop scheduling, branch and bound, disjunctive graph formulation, simulated annealing
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:8799
Deposited By: Ms Zalinda Shuratman
Deposited On:12 May 2009 08:28
Last Modified:11 Jun 2010 02:02

Repository Staff Only: item control page