Results 201 to 210 of about 50,399 (258)
Optimization of train real-time dynamic scheduling under unexpected events in high-speed railway based on MAPPO. [PDF]
Tang Z, Huang P, Sun J.
europepmc +1 more source
Construction and prototype effect evaluation of a multi-agent collaborative system for operating room nursing. [PDF]
Li Y, Zou J, Wang L, Zhao R, Yuan J.
europepmc +1 more source
Negotiation-augmented federated reinforcement learning for conflict-free edge-cloud stream scheduling. [PDF]
Kang X, Hua C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Resource-Constrained Assignment Scheduling
Operations Research, 1986Many resource-constrained assignment scheduling problems can be modeled as 0-1 assignment problems with side constraints (APSC). Unlike the well-known assignment problem of linear programming, APSC is NP-complete. In this paper we define a branch-and-bound algorithm for solving APSC to optimality.
Joseph B Mazzola, Alan W Neebe
exaly +2 more sources
[1989] Proceedings. Real-Time Systems Symposium, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donald W. Gillies, Jane W.-S. Liu
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donald W. Gillies, Jane W.-S. Liu
openaire +1 more source
Reconfigurable resource scheduling
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006We consider a class of scheduling problems that we refer to as reconfigurable resource scheduling. This class of problems is motivated by emerging applications that involve dynamically allocating a large number of shared resources to a variety of services. We design efficient online algorithms for certain problems in this class.
C. Greg Plaxton +3 more
openaire +1 more source
Scheduling and Resource Allocation
2015Chap.8 SCHEDULING AND RESOURCE ALLOCATION - 8.1 Introduction: Energy-Aware Scheduling 8.2 Use of Linear Programming in Energy-Aware Scheduling 8.2.1 Finding the Optimal Solution Using a Linear Program 8.2.2 Benefits and Limitations of LP 8.3 Heuristics in Large Instances 8.3.1 Energy-Aware Greedy Algorithms 8.3.2 Vector Packing 8.3.3 Improving Fast ...
Agrawal, Pragati +9 more
openaire +3 more sources
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
Interprocess interactions in concurrent programs serve two major functions: conditional exclusion and scheduling. This article presents high-level techniques for specification of scheduling policies, and for proving the starvation-free property of scheduling policies after they are formally specified.
Chyuan Samuel Hsieh, Elizabeth A. Unger
openaire +1 more source
Interprocess interactions in concurrent programs serve two major functions: conditional exclusion and scheduling. This article presents high-level techniques for specification of scheduling policies, and for proving the starvation-free property of scheduling policies after they are formally specified.
Chyuan Samuel Hsieh, Elizabeth A. Unger
openaire +1 more source
European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

