In this paper, we apply the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization. We show that our implementation of this methodâ€¦ (More)

The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depotâ€¦ (More)

The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning eachâ€¦ (More)

We consider a generalization of the assignment problem in which an integer k is given and one wants to assign k rows to k columns so that the sum of the corresponding costs is a minimum. The problemâ€¦ (More)

The Vehicle Scheduling Problem is an important combinatorial optimization problem arising in the management of transportation companies. It consists in assigning a set of time-tabled trips to a setâ€¦ (More)

A recently published paper by E. Mokotoff presents an exact algorithm for the classical P ||Cmax scheduling problem, evaluating its average performance through computational experiments on a seriesâ€¦ (More)