Results 291 to 300 of about 1,347,718 (326)
Enabling continuous 24/7 vertical mobility in High-Rise buildings by integrating critical activity scheduling and night shift planning. [PDF]
Sci RepAhmadnia M, Maghrebi M, Khodatars F.
europepmc +1 more source
Two-Level Scheduling Algorithm for Different Classes of Traffic in WiMAX Networks
, 2014 Zeeshan Ahmed, Salima Hamma
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Current Opinion in Psychology, 2019
To schedule activities and transition from one activity to the next, humans can rely on the external clock (clock-time style) or on their internal sense (event-time style). This article discusses how relying on an external time cue versus an internal time cue can markedly shape the way people perceive the social world, beyond its mere purpose of ...
Anne-Laure, Sellier, Tamar, Avnet
openaire +2 more sources
To schedule activities and transition from one activity to the next, humans can rely on the external clock (clock-time style) or on their internal sense (event-time style). This article discusses how relying on an external time cue versus an internal time cue can markedly shape the way people perceive the social world, beyond its mere purpose of ...
Anne-Laure, Sellier, Tamar, Avnet
openaire +2 more sources
2012 19th International Conference on High Performance Computing, 2012
We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns.
Pinheiro, Vinicius +2 more
openaire +1 more source
We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns.
Pinheiro, Vinicius +2 more
openaire +1 more source
Real-Time Systems, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weirong +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weirong +2 more
openaire +1 more source
Operations Research, 1997
We consider the open shop, job shop, and flow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is 𝒩𝒫-complete. The latter result implies that, unless 𝒫 = 𝒩𝒫, there does not exist a
Williamson, David P. +6 more
openaire +3 more sources
We consider the open shop, job shop, and flow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is 𝒩𝒫-complete. The latter result implies that, unless 𝒫 = 𝒩𝒫, there does not exist a
Williamson, David P. +6 more
openaire +3 more sources
List-Scheduling versus Cluster-Scheduling
IEEE Transactions on Parallel and Distributed Systems, 2018In scheduling theory and parallel computing practice, programs are often represented as directed acyclic graphs. Finding a makespan-minimising schedule for such a graph on a given number of homogenous processors ( $P|prec,c_{ij}|C_{\max}$ ) is an NP-hard optimisation problem.
Huijun Wang, Oliver Sinnen
openaire +1 more source
Schedule Development under Stochastic Scheduling
Journal of the Construction Division, 1982A most effective use of Monte-Carlo schedule generation is to create a control schedule of the planning, design and construction of a major project. The normal Monte-Carlo process will yield a distribution for the time required for project completion, activity criticality and list potential critical paths.
Keith C. Crandall, John C. Woolery
openaire +1 more source