In their seminal paper that initiated the field of algorithmic mechanism design,\citet {NR99}
studied the problem of designing strategyproof mechanisms for scheduling jobs on …

An important goal of modern scheduling systems is to efficiently manage power usage. In
energy-efficient scheduling, the operating system controls the speed at which a machine is …

The modern network aims to prioritize critical traffic over non-critical traffic and effectively
manage traffic flow. This necessitates proper buffer management to prevent the loss of …

We consider online scheduling on unrelated (heterogeneous) machines in a speed-
oblivious setting, where an algorithm is unaware of the exact job-dependent processing …

We study three two-stage optimization problems with a similar structure and different
objectives. In the first stage of each problem, the goal is to assign input jobs of positive sizes …

We consider a new scheduling problem on parallel identical machines in which the number
of machines is initially not known, but it follows a given probability distribution. Only after all …

Parameters characterizing safety critical systems are generally assigned very conservative
values for reasons of safety assurance. Provisioning computing resources on the basis of …

Uncertainty surrounds us daily, indicating the need for effective decision-making strategies.
In recent years, the large amount of available data has accelerated the development of …

Unrelated machines are an abstraction of many scheduling environments appearing in
practical applications, where every job may be processed at a different speed on every …

Traditionally, algorithms have been evaluated through worst-case analysis, where the input
is presumed to take its worst possible configuration. However, in many real-world settings …