Evaluating flexible job shop algorithms and comparison with 2 part genetic algorithm
This paper consider flexible jobshop scheduling problem with minimizing maximum completion time of orders(Cmax), maximum workload of machines(Wmax) and total workloads (WT). The problem is known as Np-Hard. So finding the optimal solution in a reasonable time is impossible. A genetic algorithm named...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Semnan University
2015-03-01
|
| Series: | مجله مدل سازی در مهندسی |
| Subjects: | |
| Online Access: | https://modelling.semnan.ac.ir/article_1699_0d4dce899d1c2eecd13f4df22aeb67fe.pdf |