A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem
Job Shop Scheduling Problem (JSSP) is one of the well-known hardest combinatorial optimization problems. The goal of this research is to study an efficient scheduling method based on Genetic Algorithm (GA) to address JSSP. A GA based on Giffer and Thompson (GT) algorithm known as GT-GA that utilizes...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Department of Mathematics, Faculty of Science,
2006-12.
|
| Subjects: | |
| Online Access: | Get fulltext |