Scheduling with deadlines and loss functions.Management Science, 12(7), 1959. B. Randell, P. A. Lee, and P. C. Treleaven. Reliability issues in computing system design.ACM Computing Surveys, 10(2):123–166, 1978. Google Scholar K. Ramamritham and J. A. Stankovic. Scheduling ...
McNaughton, R., “Scheduling with deadlines and loss functions,” Management Science, 6, 1–12 (1959). Article Google Scholar Mu’alem, A. W. and D. G. Feitelson, “Preemptive bicriteria scheduling for parallel jobs: Off-line and on-line algorithms. Technical Report 99-36,” Leibniz ...
On Scheduling Tasks with Associated Linear Loss Functions In a recent paper in Management Science, Robert McNaughton has discussed certain problems encountered in scheduling tasks on one or more processors when penalties are imposed if the tasks are finished after their respective deadlines. In... A...
There is a need to deal with routine sensor signals on a periodic basis, as well as unpredictable (asynchronous) events such as alarm signals indicating detected faults while ensuring that the control signals to move control surfaces do not miss their deadlines. The various computation and control...
Hariri and Potts (1994) also aim at minimizing the weighted version of the same function with deadlines by using DP as a subroutine for job penalties, showing promising results for at most 300 jobs. Additionally, the organization and theorems proposed by Woeginger (2000) has enabled the ...
and requires a platform to handle these tasks. Furthermore, IoT applications conduct various tasks with varying priorities and deadlines that must be performed without delay. Still, remote execution of these tasks in the cloud server creates multiple issues, including higher latency and limited ...
To address trust constraints in a heterogeneous multi-cloud environment, this work proposes a novel scheduling method called matching and multi-round allocation (MMA) to optimize the makespan and total cost for all submitted tasks subject to security and reliability constraints. The method is divided...
that are built for tip failure. For task clustering, we used a modified pigeon-inspired optimization (MPIO) algorithm. The activation function ties the information about the concealed state of prior deadlines to the item in the current chronology, and it provides it to the entrance gate as ...
McNaughton, R., Scheduling with Deadlines and Loss Functions, Manage. Sci., 1959, vol. 6, no. 1, pp. 1–12. Article MATH MathSciNet Google Scholar Karp, R.M., Reducibility among Combinatorial Problems, in Complexity of Computer Computations, Miller, R.E. and Thatcher, J.W., Eds....
(1959). Scheduling with deadlines and loss functions. Management Science, 6, 1–12. Article Google Scholar Download references Acknowledgments M. Chrobak was partially supported by National Science Foundation Grant CCF-1217314. The authors would like to thank anonymous reviewers for many useful ...