Welcome to the InfoSci Platform
Reference Hub2
Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy

Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy

Vardan Mkrttchian, Safwan Al Salaimeh
Copyright: © 2019 |Volume: 7 |Issue: 4 |Pages: 15
ISSN: 2166-7160|EISSN: 2166-7179|EISBN13: 9781522568292|DOI: 10.4018/IJSI.2019100104
Cite Article Cite Article

MLA

Mkrttchian, Vardan, and Safwan Al Salaimeh. "Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy." IJSI vol.7, no.4 2019: pp.71-85. http://doi.org/10.4018/IJSI.2019100104

APA

Mkrttchian, V. & Al Salaimeh, S. (2019). Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy. International Journal of Software Innovation (IJSI), 7(4), 71-85. http://doi.org/10.4018/IJSI.2019100104

Chicago

Mkrttchian, Vardan, and Safwan Al Salaimeh. "Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy," International Journal of Software Innovation (IJSI) 7, no.4: 71-85. http://doi.org/10.4018/IJSI.2019100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

An approximate iterative algorithm is described, allowing the solving of general problems in the theory of schedules. The theoretical and experimental characteristic of the new algorithm are given, as well as ways of finding out its variable indicators by using parallelization computing and the implementation of a parallel version of the algorithm microprocessor. In this way, the authors have described a practical approximate algorithm for time, to solve the general problem of scheduling theory with an average error of 8% less.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.