Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time
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 algorit...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2009-07-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163796_cd298b8dc4e00b79f08e62e15286ec30.pdf |
| Summary: | 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. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |