A hybrid meta-heuristic algorithm for dual resource constrained flexible job shop scheduling problem
In this paper, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) with objective of minimizing the makespan is investigated. Under studied problem is NP-hard and mainly includes three sub-problems. The first one is to assign each operation to a machine out of a set of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Allameh Tabataba'i University Press
2015-01-01
|
| Series: | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| Subjects: | |
| Online Access: | http://jims.atu.ac.ir/article_586_320fcbd59a67cc3680315cafc70911a6.pdf |