scholarly journals Solving a tropical optimization problem with application to optimal scheduling

Author(s):  
Nikolai K. Krivulin ◽  
◽  
Ulyana L. Basko ◽  
2016 ◽  
Vol 26 (02) ◽  
pp. 1650009 ◽  
Author(s):  
Yang Wang ◽  
Wei Shi ◽  
Kenneth B. Kent

In this paper, we consider optimal scheduling algorithms for scientific workows with two typical structures, fork&join and tree, on a set of provisioned (virtual) machines under budget and deadline constraints in cloud computing. First, given a total budget B, by leveraging a bi-step dynamic programming technique, we propose optimal algorithms in pseudo-polynomial time for both workows with minimum scheduling length as a goal. Our algorithms are efficient if the total budget B is polynomially bounded by the number of jobs in respective workows, which is usually the common case in practice. Second, we consider the dual of this optimization problem to minimize the cost when the deadline of the computation D is fixed. We change this problem into the standard multiple-choice knapsack problem via a parallel transformation.


Author(s):  
Theodore T. Allen ◽  
Olivia K. Hernandez ◽  
Sayak Roychowdhury ◽  
Emily S. Patterson

There is a great need for creating schedules that are optimized. Yet, some individuals have had less than desirable experiences with “optimal” scheduling. This could have been due to prioritization of the wrong criteria, leading to schedules that did not make practical sense, or that were math-intensive and were not able to be easily interpreted. Also, there are many types of optimization problem formulations and solution methods. Here, we divide the formulations into two major types: batched and online scheduling classes are discussed. A different technique has been created that allows schedules to be made that are not only optimal, based on the formulations or framing, but that are actually useful. Here, we discuss two types of methods, one batched called Genetic Algorithms with an Earliest Due Date encoding Method (GAGEDD) and the other online called Markov Decision Processes and Reinforcement Learning extensions. These methods are already being employed to create practical and optimal schedules that can include many different constraints and are able to instantly take into account new scheduling requests and take optimal actions regardless of what state the system is currently in. Especially with current world events (COVID-19), it is important to intelligently schedule patients.


Sign in / Sign up

Export Citation Format

Share Document