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: | , , , |
|---|---|
| 格式: | Citation Index Journal |
| 出版: |
Inderscience
2008
|
| 主題: | |
| 在線閱讀: | http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf http://eprints.utp.edu.my/3229/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|