Solving the Resource-Constrained Project Scheduling Problems (RCPSP) Using Developed Imperialistic Competition Algorithm (DICA)
The scheduling problems are the non-polynomial problems-hard (NP-Hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.In this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constraine...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Tehran
2015-06-01
|
| Series: | مدیریت صنعتی |
| Subjects: | |
| Online Access: | https://imj.ut.ac.ir/article_57204_5b4c2817ec042493a03e7b7452abfcf6.pdf |