We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

General: The machine load balancing problem is defined as follows: There are n parallel
machines and a number of independent tasks (jobs); the tasks arrive at arbitrary times …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive
sequentially and require immediate packing decisions without any information about the …

When I started my Ph. D. four years ago, the area of on-line machine scheduling was new to
me. That it wasn't much older to the rest of the world, became clear after I counted the few …

We consider an uncapacitated stochastic vehicle routing problem in which vehicle depot
locations are fixed, and client locations in a service region are unknown but are assumed to …

We are given a sequence of items that can be packed into m unit size bins. In the classical
bin packing problem we fix the size of the bins and try to pack the items in the minimum …

This paper investigates two different semi on-line scheduling problems on a two-machine
system. In the first case, we assume that all jobs have their processing times in between p …

We study the advice complexity and the random bit complexity of the online knapsack
problem. Given a knapsack of unit capacity, and n items that arrive in successive time steps …

We investigate the problem of semi-online scheduling jobs on m identical parallel machines
where the jobs arrive in order of decreasing sizes. We present a complete solution for the …