Relational granulation method based on quotient space theory for maximum flow problem

S Zhao, X Sun, J Chen, Z Duan, Y Zhang, Y Zhang - Information Sciences, 2020 - Elsevier
Granular computing (GrC) is a problem-solving concept deeply rooted in human thinking.
GrC, as a new and rapidly growing paradigm of information processing, has attracted the …

A scheduling framework for distributed key-value stores and its application to tail latency minimization

S Ben Mokhtar, LC Canon, A Dugois, L Marchal… - Journal of …, 2024 - Springer
Distributed key-value stores employ replication for high availability. Yet, they do not always
efficiently take advantage of the availability of multiple replicas for each value and read …

Semi-online scheduling on two uniform parallel machines with initial lookahead

F Zheng, Y Chen, M Liu - RAIRO-Operations Research, 2024 - rairo-ro.org
This work studies the problem of semi-online scheduling on two uniform parallel machines
with speeds 1 and s (≥ 2), respectively. We introduce a novel concept of initial lookahead in …

Two-Agent Scheduling with Resource Augmentation on Multiple Machines

V Fagnon, G Lucarelli, C Mommessin… - European Conference on …, 2022 - Springer
We are interested in this paper in studying how to schedule tasks in an extreme edge
setting, where some sensors produce data and subsequent tasks are executed locally. They …

Non-preemptive flow-time minimization via rejections

A Gupta, A Kumar, J Li - arxiv preprint arxiv:1805.09602, 2018 - arxiv.org
We consider the online problem of minimizing weighted flow-time on unrelated machines.
Although much is known about this problem in the resource-augmentation setting, these …

Ordonnancement Deux-Agents avec Augmentation de Ressources

V Fagnon, G Lucarelli, C Mommessin… - … et d'Aide à la Décision, 2022 - hal.science
La plupart des données produites par les capteurs de l'Internet des Objets n'ont d'intérêt que
pour leur environnement local et ont une durée de vie courte. Dans ce travail, nous ciblons …