- 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
Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 5, Volume 6, Issue 2, 2009, Pages 49-59 PDF (313.94 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2009.163796 | ||
| Author | ||
| Kawa A. Al-Qazilchy | ||
| College of Sciences University of Salahaddin | ||
| Abstract | ||
| We solvein this paper some machine scheduling problems with certain conditions; the solution had been made by using dynamic programming procedures with a fixed time for all the algorithms. Some of the algorithms described in the paper represent a modification to some mathematical programming algorithms and some of them are new or a generalization to others. The optimal solution of all these algorithms will be done with a fixed complexity time, which may lead us to solve them easier and faster. | ||
| Keywords | ||
| Scheduling; single machine; set-up times; Dynamic programming; fixed complexity | ||
|
Statistics Article View: 314 PDF Download: 255 |
||