%0 Journal Article
%T A Branch and Bound and Simulated Annealing Approach for Job Shop Scheduling
%A Tan Hui Woon
%A Sutinah Salim
%J Matematika
%D 2004
%I Universiti Teknologi Malaysia
%X 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.
%K Job shop scheduling
%K branch and bound
%K disjunctive graph formulation
%K simulated annealing.
%U http://www.fs.utm.my/matematika/images/stories/matematika/200420101.pdf