Results 11 to 20 of about 516,457 (276)
Sensors, 2021 Wireless sensor networks are appealing, largely because they do not need wired infrastructure, but it is precisely this feature that renders them energy-constrained.
Liangshun Wu, Hengjin Cai
doaj +1 more source
Scheduling Reconfigurable Service Function Chain [PDF]
Chinese Journal of Electronics, 2019 Network function virtualization (NFV), has been widely adopted in existing networks since it brings lower capital expenditure and operating expense, as well as flexible and elastic deployment. Based on NFV, dynamic Service function chain (SFC) provides more comprehensive and thorough traffic steering over a series of middleboxes, e.g., DPI, and IDS ...
Kai Zhu, Chunming Wu, Boyang Zhou
openaire +1 more source
Internet Technology Letters, 2020 6TiSCH is a standardization group within the Internet Engineering Task Force (IETF) that works on IPv6‐enabled Time‐slotted Channel Hopping (TSCH) networks. The 6TiSCH protocol stack, designed by the standardization work at the IETF, has direct applicability to low‐power Internet of Things (IoT) use cases, including smart factory, building ...
Chang, Tengfei +4 more
openaire +3 more sources
Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling [PDF]
, 2000 A distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used
Muresan, Valentin +3 more
core +1 more source
Elastic job scheduling with unknown utility functions
Performance Evaluation, 2021 We consider a bipartite network consisting of job schedulers and parallel servers. Jobs arrive at the schedulers following stochastic processes with unknown arrival rates, and get routed to the servers, which execute the jobs with unknown service rates.
Fu, Xinzhe, Modiano, Eytan
openaire +1 more source
List scheduling revisited [PDF]
, 1996 We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times.
Schutten, J.M.J.
core +2 more sources
A linear programming-based method for job shop scheduling [PDF]
, 2012 We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any ...
A. P. J. Vepsalainen +27 more
core +4 more sources
Enriching the tactical network design of express service carriers with fleet scheduling characteristics [PDF]
, 2009 Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes.
Cruijssen, F.C.A.M. +3 more
core +11 more sources
Real-Time Selection System of Dispatching Rules for the Job Shop Scheduling Problem
Machines, 2023 Personalized market demands make the job shop scheduling problem (JSSP) increasingly complex, and the need for scheduling methods that can solve scheduling strategies quickly and easily has become very urgent.
Anran Zhao +5 more
doaj +1 more source
A combined tree growing technique for block-test scheduling under power constraints [PDF]
, 2001 A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits.
Muresan, Valentin +3 more
core +1 more source