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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Citation Index Journal |
| Published: |
Inderscience
2008
|
| Subjects: | |
| 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!
|