JobCats solving cryptarithmetic puzzle using CSO algorithm
Job Shop Scheduling Problem (JSSP) is a difficult scheduling problem that has no easy way of getting the optimal value. This problem is well-studied because of its various real-world applications especially in the field manufacturing and service industries since JSSP tends to improve some measures o...
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Thesis |
| Hizkuntza: | English |
| Argitaratua: |
2011.
|
| Gaiak: |