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
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.
|Uncontrolled Keywords:||job shop scheduling, branch and bound, disjunctive graph formulation, simulated annealing|
|Subjects:||Q Science > QA Mathematics|
|Deposited By:||Ms Zalinda Shuratman|
|Deposited On:||12 May 2009 08:28|
|Last Modified:||07 Feb 2017 06:57|
Repository Staff Only: item control page