Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 6, Issue 2
  3. Author

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time

    Kawa A. Al-Qazilchy

AL-Rafidain Journal of Computer Sciences and Mathematics, 2009, Volume 6, Issue 2, Pages 49-59
10.33899/csmj.2009.163796

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

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
  • PDF (314 K)
  • XML
(2009). Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time. AL-Rafidain Journal of Computer Sciences and Mathematics, 6(2), 49-59. doi: 10.33899/csmj.2009.163796
Kawa A. Al-Qazilchy. "Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time". AL-Rafidain Journal of Computer Sciences and Mathematics, 6, 2, 2009, 49-59. doi: 10.33899/csmj.2009.163796
(2009). 'Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time', AL-Rafidain Journal of Computer Sciences and Mathematics, 6(2), pp. 49-59. doi: 10.33899/csmj.2009.163796
Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time. AL-Rafidain Journal of Computer Sciences and Mathematics, 2009; 6(2): 49-59. doi: 10.33899/csmj.2009.163796
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 28
  • PDF Download: 34
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus