The emergence of fuzzy sets makes job-shop scheduling problem (JSSP) become better
aligned with the reality. This article addresses the JSSP with fuzzy execution time and fuzzy …

To improve the processing efficiency of jobs in distributed computing, the concept of coflow
is proposed. A coflow is a collection of flows that are semantically correlated in a multi-stage …

Datacenter networks are critical to Cloud computing. The coflow abstraction is a major leap
forward of application-aware network scheduling. In the context of multistage jobs, there are …

Traditional network resource management mechanisms are mainly flow or packet based.
Recently, coflow has been proposed as a new abstraction to capture the communication …

Applications designed for data-parallel computation frameworks such as MapReduce
usually alternate between computation and communication stages. Coflow scheduling is a …

The coflow scheduling problem has emerged as a popular abstraction in the last few years
to study data communication problems within a data center [6]. In this basic framework, each …

Applications in data-parallel computing typically consist of multiple stages. In each stage, a
set of intermediate parallel data flows (Coflow) is produced and transferred between servers …

To improve the application-level data efficiency, the scheduling of coflows, defined as a
collection of parallel flows sharing the same objective, is prevailing in recent data centers …

Finding an optimal/near-optimal scheduling algorithm to minimize the age of information
(AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a …

Problem definition: Cloud computing is recognized as a critical driver of information
technology–enabled innovations. The operations management (OM) community, however …