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

The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest
to many researchers from mathematics, economics, and computer science. Manifold TSP …

We study a scheduling problem in which jobs have locations. For example, consider a
repairman that is supposed to visit customers at their homes. Each customer is given a time …

We consider a generalization of the classical open shop and flow shop scheduling problems
where the jobs are located at the vertices of an undirected graph and the machines, initially …

This paper examines two variants of strip packing: when the rectangles to be placed have
precedence constraints and when the rectangles have release times. Strip packing can be …

In this paper, we consider the single vehicle scheduling problem (SVSP) on networks. Each
job, located at some node, has a release time and a handling time. The vehicle starts from a …

In this paper, we consider a scheduling problem of vehicles on a path G with n vertices and
n− 1 edges. There are m identical vehicles. Each vertex in G has exactly one job. Any of the …

We consider the single vehicle scheduling problem in which the customers are located at
the vertices of a tree or a cycle, and have release and service time requirements. The …

We consider the following vehicle scheduling problem. There are some customers on a line
that will be served by a single vehicle. Each customer is associated with a release time and …

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on
a path to minimize some regular function of the visiting times of the customers. For the single …