We study a selective and periodic inventory routing problem (SPIRP) and develop an Adaptive Large Neighborhood Search (ALNS) algorithm for its solution. The problem concerns a biodiesel production facility collecting used vegetable oil from sources, such as restaurants, catering companies and...

We examine simultaneous order acceptance and scheduling decisions where the orders are defined by their release dates, due dates, deadlines, processing times, sequence dependent setup times and revenues in a single machine environment. The objective is to maximize total revenue, where the...

The problem of product assortment and inventory planning under customer-driven demand substitution is analyzed and a mathematical model for this problem is provided in this paper. Realistic issues in a retail context such as supplier selection, shelf space constraints, and poor quality...

We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a...

We consider a problem that arises in disaster-related strategic planning: investing in the links of a stochastic network to improve its expected post-disaster performance. We are given a network whose links are subject to random failures, where the failure probability of a link is reduced by...

We optimize ordering and inbound shipment decisions for a manufacturer that sources multiple items from a single supplier. The objective is to satisfy the requirements in the production plan with minimum transportation and inventory holding costs over a multi-period planning horizon....

In this paper we study the single-machine problem 1|chains(l), p <Subscript> j </Subscript>=p|∑ C <Subscript> j </Subscript> in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between...</subscript></subscript>

In this paper we study the single-machine problem 1|chains(l), p j =p|∑ C j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between...