Cover Image

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

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 th...

Full description

Saved in:
Bibliographic Details
Main Authors: Dominic P, Dhanapal Durai, Ahmad, Kamil, Parthiban, P, Lenny Koh, SC
Format: Citation Index Journal
Published: Inderscience 2008
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf
http://eprints.utp.edu.my/3229/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.3229
record_format eprints
spelling my.utp.eprints.32292017-01-19T08:26:28Z A comparative representation approach to modern heuristic search methods in a job shop Dominic P, Dhanapal Durai Ahmad, Kamil Parthiban, P Lenny Koh, SC QA75 Electronic computers. Computer science 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. Inderscience 2008 Citation Index Journal PeerReviewed application/pdf http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf 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] http://eprints.utp.edu.my/3229/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Dominic P, Dhanapal Durai
Ahmad, Kamil
Parthiban, P
Lenny Koh, SC
A comparative representation approach to modern heuristic search methods in a job shop
description 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.
format Citation Index Journal
author Dominic P, Dhanapal Durai
Ahmad, Kamil
Parthiban, P
Lenny Koh, SC
author_facet Dominic P, Dhanapal Durai
Ahmad, Kamil
Parthiban, P
Lenny Koh, SC
author_sort Dominic P, Dhanapal Durai
title A comparative representation approach to modern heuristic search methods in a job shop
title_short A comparative representation approach to modern heuristic search methods in a job shop
title_full A comparative representation approach to modern heuristic search methods in a job shop
title_fullStr A comparative representation approach to modern heuristic search methods in a job shop
title_full_unstemmed A comparative representation approach to modern heuristic search methods in a job shop
title_sort comparative representation approach to modern heuristic search methods in a job shop
publisher Inderscience
publishDate 2008
url http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf
http://eprints.utp.edu.my/3229/
_version_ 1738655253346123776
score 13.244413

Similar Items