Logo

A comparative representation approach to modern heuristic search methods in a job shop

Dominic P, Dhanapal Durai and Ahmad, Kamil and Parthiban, P and Lenny Koh, SC (2008) A comparative representation approach to modern heuristic search methods in a job shop. [Citation Index Journal]

[img] PDF (IJLEG paper)
Restricted to Registered users only

118Kb

Abstract

Abstract: The job shop problem is among the class of non-deterministic polynomial time hard combinatorial problems. This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. The popular search techniques, such as the genetic algorithm and simulated annealing are used for the determination of the objectives like minimisations of the makespan time and mean flow time. Various rules, such as the SPT, LPT, MWKR and LWKR are used for the objective function to attain the results. The summary of results from this article gives a conclusion that the genetic algorithm gives better results in the makespan time determination on both the job-based representation and the rulebased representation and the simulated annealing algorithm gives the better results in the mean flow time in both the representations.

Item Type:Citation Index Journal
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:3229
Deposited By: Assoc Prof Dr Dhanapal Durai Dominic P
Deposited On:16 Nov 2010 04:01
Last Modified:19 Jan 2017 08:26

Repository Staff Only: item control page

Document Downloads

More statistics for this item...