Results 1 to 10 of about 95,531 (215)
Scheduling distributed computations in non-deterministic systems [PDF]
Научно-технический вестник информационных технологий, механики и оптикиComputation scheduling is very important in the design of distributed information processing and control systems. Effective scheduling algorithms allow developer to find technical solutions that are adequate to the existing constraints.
N. V. Kolesov +3 more
doaj +3 more sources
A deterministic truthful PTAS for scheduling related machines [PDF]
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Scheduling on related machines ($Q||C_{\max}$) is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and her valuation can be expressed via a single parameter, her {\em speed ...
Christodoulou, George, Kovacs, Annamaria
core +5 more sources
Integrated Scheduling Algorithm Based on Matching Game Theory in LEO Satellite Networks [PDF]
SensorsAs an indispensable component of space–terrestrial integrated networks, low-Earth orbit (LEO) satellite networks are capable of providing flexible access and low delay communication services for emerging time-sensitive traffic.
Yuan Xing, Guofeng Zhao, Zhenzhen Han
doaj +2 more sources
A New Lower Bound for Deterministic Truthful Scheduling [PDF]
Algorithmica, 2020 We study the problem of truthfully scheduling $m$ tasks to $n$ selfish unrelated machines, under the objective of makespan minimization, as was introduced in the seminal work of Nisan and Ronen [STOC'99].
A Filos-Ratsikas +22 more
core +3 more sources
The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review [PDF]
, 2018 Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration.
Diaz-Serna, F. Javier +1 more
core +5 more sources
Lower bounds for Smith's rule in stochastic machine scheduling [PDF]
, 2010 We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed that scheduling the jobs according to the WSPT rule -also known as Smith's
Jagtenberg, Caroline +2 more
core +18 more sources
The complexity of some deterministic scheduling problems
, 1980 "Spring 1980."
James O. Achugbue
openalex +2 more sources
Mining, 2022 Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops a computationally efficient algorithm to solve open pit production scheduling problems under uncertain ...
Devendra Joshi +3 more
doaj +1 more source
IEEE Access, 2020 As a key characteristic for industrial wireless sensor networks, deterministic scheduling aims to ensure that real-time data flows arrive at destination devices under deadline constraints by allocating necessary communication resources, such as time ...
Heng Wang +3 more
doaj +1 more source
Frontiers in Energy Research, 2023 The growing scale of electric vehicles (EVs) brings continuous challenges to the energy trading market. In the process of grid-connected charging of EVs, disorderly charging behavior of a large number of EVs will have a substantial impact on the grid ...
Dou An, Feifei Cui, Xun Kang
doaj +1 more source