We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identical machines with the objective of minimizing the makespan. The problem is known to be strongly NP-hard. Here, we prove that it is binary NP-hard even with three chains. Furthermore, we...

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.

In this paper, we analyse the distribution system of an Italian company operating in the ice cream and frozen food industry. In particular, we address the problem of optimally allocating products demand to distribution centres spread over the Italian territory and develop a mixed integer...

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its...

In this paper, we propose a tool for testing the quality of heuristic solutions for scheduling problems with a min-max objective function, such as, for example, the minimization of maximum tardiness or makespan. We present a bounding scheme which is powerful enough to allow an accurate quality...