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...
| Main Authors: | , , , |
|---|---|
| Format: | Citation Index Journal |
| Language: | English |
| Published: |
Inderscience
2008
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/3229/ http://scholars.utp.edu.my/id/eprint/3229/1/IJLEG2008paper.pdf |
| _version_ | 1848659369389981696 |
|---|---|
| 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 |
| building | UTP Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-13T07:29:20Z |
| format | Citation Index Journal |
| id | oai:scholars.utp.edu.my:3229 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:29:20Z |
| publishDate | 2008 |
| publisher | Inderscience |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:32292017-01-19T08:26:28Z http://scholars.utp.edu.my/id/eprint/3229/ 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 en http://scholars.utp.edu.my/id/eprint/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] |
| 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 |
| title | 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_short | 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 |
| topic | QA75 Electronic computers. Computer science |
| url | http://scholars.utp.edu.my/id/eprint/3229/ http://scholars.utp.edu.my/id/eprint/3229/1/IJLEG2008paper.pdf |