Machine scheduling problem has been extensively studied by researchers for many decades in view of its numerous applications on solving practical problems. Due to the complexity of this class of scheduling problems, various approximation solution approaches have been presented in the literature....

Driving is a safety critical task that requires a high level of attention from the driver. Although drivers have limited attentional resources, they often perform secondary tasks such as eating or using a mobile phone. When performing multiple tasks in the vehicle, the driver can become...

The symmetric quadratic knapsack problem (SQKP), which has several applications in machine scheduling, is NP-hard. An approximation scheme for this problem is known to achieve an approximation ratio of (1+ϵ) for any ϵ0. To ensure a polynomial time complexity, this approximation scheme needs an...

Given k identical salesmen, where k⩾2 is a constant independent of the input size, the min–max k-traveling salesmen problem on a tree is to determine a set of k tours for the salesmen to serve all customers that are located on a tree-shaped network, so that each tour starts from and returns...

We consider a problem faced by a buying office for one of the largest retail distributors in the world. The buying office plans the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, many of which have...