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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Citation Index Journal |
| 出版事項: |
Inderscience
2008
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf http://eprints.utp.edu.my/3229/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|