Synthesizing optimization algorithms for scheduling partially ordered set of problems

Synthesizing optimization algorithms for scheduling partially ordered set of problems

0.00 Avg rating0 Votes
Article ID: iaor2012210
Volume: 73
Issue: 1
Start Page Number: 186
End Page Number: 190
Publication Date: Jan 2012
Journal: Automation and Remote Control
Authors: ,
Keywords: heuristics, optimization
Abstract:

We consider the issues of optimal algorithms synthesis in the scheduling theory from a set of heuristic algorithms with low computational complexity. Optimal algorithm is derived which includes no more than seven tasks with identical duration of operations.

Reviews

Required fields are marked *. Your email address will not be published.