Search results for "scheduling."
showing 10 items of 270 documents
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph
2012
International audience; This paper presents a generalization of the coupled-task sche-duling problem introduced by Shapiro \cite{Shapiro}, where considered tasks are subject to incompatibility constraints depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the boundary between $\mathcal{P}$ and $\mathcal{NP}$-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of …
Joint routing and per-flow fairness in wireless multihop networks
2008
In wireless multihop networks communication between two end-nodes is carried out by hopping over multiple short wireless links. Traditional CSMA/CA based media access control does not work satisfactory in a multihop scenario, since an intended target of a communication may be subject to mutual interference imposed by concurrent transmissions from nodes which cannot directly sense each other, causing unfair throughput allocation. Although TDMA seems to be a more promising solution, careful transmission scheduling is needed in order to achieve error-free communication and fairness. In our previous work, a TDMA scheduling algorithm has been proposed that schedules the transmissions in a fair m…
Priority Enabled Grant-Free Access With Dynamic Slot Allocation for Heterogeneous mMTC Traffic in 5G NR Networks
2021
Although grant-based mechanisms have been a predominant approach for wireless access for years, the additional latency required for initial handshake message exchange and the extra control overhead for packet transmissions have stimulated the emergence of grant-free (GF) transmission. GF access provides a promising mechanism for carrying low and moderate traffic with small data and fits especially well for massive machine type communications (mMTC) applications. Despite a surge of interest in GF access, how to handle heterogeneous mMTC traffic based on GF mechanisms has not been investigated in depth. In this paper, we propose a priority enabled GF access scheme which performs dynamic slot …
An effective approach for the maintenance scheduling in large systems with required reliability level: A case study
2015
This paper deals with the problem of the maintenance scheduling in a multi-component system for which a required reliability level has to be warranted until the next planned stop for maintenance. Particularly, the tackled problem concerns both the determination of the elements set on which to perform preventive maintenance and the optimal number of maintenance crews in order to warranty the required reliability level at the minimum maintenance cost. The problem is formulated as a mathematical programming model that becomes very hard to solve for large practical systems. For such reason, a new effective approach based on a constrained genetic algorithm is herein proposed and tested with refe…
LPV model identification for gain scheduling control: An application to rotating stall and surge control problem
2006
Abstract We approach the problem of identifying a nonlinear plant by parameterizing its dynamics as a linear parameter varying (LPV) model. The system under consideration is the Moore–Greitzer model which captures surge and stall phenomena in compressors. The control task is formulated as a problem of output regulation at various set points (stable and unstable) of the system under inputs and states constraints. We assume that inputs, outputs and scheduling parameters are measurable. It is worth pointing out that the adopted technique allows for identification of an LPV model's coefficients without the requirements of slow variations amongst set points. An example of combined identification…
Scheduling a cellular manufacturing system with GA
2002
The flexible manufacturing cell scheduling problem is considered with a multi-objective approach, pursuing together makespan minimisation and the in process job wait minimisation. The formulation of the scheduling problem is discussed, analysing how to generate well suited sequences, like generalised permutation sequences, and the proper construction of a JIT timing of activities. An evolutionary sequencing algorithm based on both classic genetic operators and hybrid operators is then proposed. The hybrid operators have been introduced to construct highly fit initial population, to perform periodically a local search on the population and to maintain enough genetical diversity in the actual…
A Population-Based Approach to the Resource-Constrained Project Scheduling Problem
2004
We present a population-based approach to the RCPSP. The procedure has two phases. The first phase handles the initial construction of a population of schedules and these are then evolved until high quality solutions are obtained. The evolution of the population is driven by the alternative application of an efficient improving procedure for locally improving the use of resources, and a mechanism for combining schedules that blends scatter search and path relinking characteristics. The objective of the second phase is to explore in depth those vicinities near the high quality schedules. Computational experiments on the standard j120 set, generated using ProGen, show that our algorithm produ…
Critical Path Analysis with Imprecise Activities Times
2018
The aim of the paper is to present the conceptual framework related to critical path analysis with imprecise activity duration times. This article is motivated by the fact that most approaches to project planning are deterministic. In reality, the problem is accompanied by uncertainty and risk associated with dealing with imprecise data. Taking this uncertainty into account when performing analyses and calculations not only helps to better project planning, but also to expand the applicability of project scheduling methods under real-life or uncertain conditions. The major contribution of this paper is the development of a novel approach to critical path analysis in the presence of uncertai…
Theoretical Game Approach for Mobile Users Resource Management in a Vehicular Fog Computing Environment
2018
Vehicular Cloud Computing (VCC) is envisioned as a promising approach to increase computation capabilities of vehicle devices for emerging resource-hungry mobile applications. In this paper, we introduce the new concept of Vehicular Fog Computing (VFC). The Fog Computing (FC) paradigm evolved and is employed to enhance the quality of cloud computing services by extending it to the edge of the network using one or more collaborative end-user clients or near-user edge devices. The VFC is similar to the VCC concept but uses vehicles resources located at the edge of the network in order to serve only local on-demand mobile applications. The aim of this paper is to resolve the problem of admissi…
Latency-Oblivious Distributed Task Scheduling for Mobile Edge Computing
2018
Mobile Edge Computing (MEC) is emerging as one of the effective platforms for offloading the resource- and latency-constrained computational services of modern mobile applications. For latency- and resource-constrained mobile devices, the important issues include: 1) minimize end-to-end service latency; 2) minimize service completion time; 3) high quality-of-service (QoS) requirement to offload the complex computational services. To address the above issues, a latencyoblivious distributed task scheduling scheme is designed in this work to maximize the QoS performance and goodput for the MEC services. Unlike most of the existing works, we consider the latency-oblivious property of different …