A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addres...
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Islamic Azad University, Qazvin Branch
2009-09-01
|
| Series: | Journal of Optimization in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.qjie.ir/article_34_6d53448b084c17a074a09e9eda857460.pdf |