We consider the problem of scheduling a maintenance activity and jobs on a single
machine, where the maintenance activity must start before a given deadline and the …

We study appointment scheduling under random service duration with unknown
distributions. Given a sequence of appointments arriving at a single server, we assign their …

This paper reviews the problems of Boolean non-linear programming related to the half-
product problem. All problems under consideration have a similar quadratic non-separable …

This paper reviews two problems of Boolean non-linear programming: the Symmetric
Quadratic Knapsack Problem and the Half-Product Problem. The problems are related since …

We study scheduling problems on a machine with varying speed. Assuming a known speed
function we ask for a cost-efficient scheduling solution. Our main result is a polynomial-time …

This paper deals with four single-machine scheduling problems (SMSPs) with a variable
machine maintenance. The objectives of the four SMSPs are to minimize mean lateness …

We consider the following single-machine scheduling problem, which is often denoted
1||∑f_j: we are given n jobs to be scheduled on a single machine, where each job j has an …

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

Continuous flow scheduling problems have their place in many industries such as gas, oil,
chemicals, glass and fluids production as well as production of granular goods and steel …

One feature of cloud storage systems is data fragmentation (or sharding) so that data can be
distributed over multiple servers and subqueries can be run in parallel on the fragments. On …