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: | Dominic P, Dhanapal Durai, Ahmad, Kamil, Parthiban, P, Lenny Koh, SC |
---|---|
格式: | Citation Index Journal |
出版: |
Inderscience
2008
|
主題: | |
在線閱讀: | http://eprints.utp.edu.my/3229/1/IJLEG2008paper.pdf http://eprints.utp.edu.my/3229/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A conflict-based priority dispatching rule and operation-based approaches to job shops
由: Dominic P, Dhanapal Durai, et al.
出版: (2004) -
Efficient algorithms for the key representation auditing scheme.
由: Asim Abdallah, Elshiekh, et al.
出版: (2009) -
A Simulated Annealing Approach to Solve Fuzzy
Multi-Objective Linear Model for Supplier Selection
in a Supply Chain
由: Parthiban, P, et al.
出版: (2010) -
A comparison of Asian airlines websites quality:using a non-parametric test
由: Dominic P, Dhanapal Durai, et al.
出版: (2011) -
Conceptualization of the Antecedents and Impacts of KMS Utilization: A preliminary framework.
由: Ishaq, Oyefolahan, et al.
出版: (2010)