In this paper we develop two models for an inventory system in which the distributor manages the inventory at the retailers location. These type of systems correspond to the Vendor Managed Inventory (VMI) systems described ib the literature. These systems are very common in many different types...

Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the...

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...

In todays competitive markets, the importance of good scheduling strategies in manufacturing companies lead to the need of developing efficient methods to solve complex scheduling problems. In this paper, we studied two production scheduling problems with sequence-dependent setups times. The...

The paper presents a new model based on the basic Maximum Capture model, MAXCAP. The New Chance–Constrained Maximum Capture modelintroduces a stochastic threshold constraint, which recognises the fact that a facility can be open only if a minimum level of demand is captured. A metaheuristic...

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed...

This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the...

In this paper we present an algorithm to assign proctors to exams. This NP-hard problem is related to the generalized assignment problem with multiple objectives. The problem consists of assigning teaching assistants to proctor final exams at a university. We formulate this problem as a...

The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is related with the design of the routes to distribute the products, in an efficient and inexpensive way. This article deals with a complex vehicle routing problem...

This paper analyses the interaction of two topics: Supply Chain Management (SCM) and Internet. Merging these two fields is a key area of concern for contemporary managers and researchers. They have realized that Internet can enhance SCM by making real time information available and enabling...