- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Using Ant Colony Algorithm to solve NP-Complete problems | ||
| JOURNAL OF THI-QAR SCIENCE | ||
| Article 1, Volume 3, Issue 1, 2013, Pages 125-134 | ||
| Author | ||
| Waffa Abdul-Abbas | ||
| Abstract | ||
| AbstractWe consider the problem of scheduling jobs on a single machine about a common due date. Our objective is to determine the common due date and processing sequence of new jobs together with the re-sequencing of old jobs which minimize the sum of jobs’ earliness/tardiness, completion time penalties and due date related penalty. We drive properties that can be used to find the optimal common due date and processing sequence. Since our problem is NP-hard, we propose Ant colony algorithm (ACO) to solve the problem efficiently. Results from computational study reveal that Ant colony algorithm (ACO) can generate near optimal solutions. | ||
|
Statistics Article View: 7 |
||