Lot-sizing and capacity planning are important supply chain decisions, and competition and cooperation affect the performance of these decisions. In this paper, we look into the dynamic lot sizing and resource competition problem of an industry consisting of multiple firms. A capacity...

The network choice revenue management problem models customers as choosing from an offerset, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear...

Rede, in verkorte vorm uitgesproken op vrijdag 20 september 2002 bij de aanvaarding van het ambt van bijzonder hoogleraar aan de Faculteit der Economische Wetenschappen, vanwege de Vereniging Trustfonds Erasmus Universiteit Rotterdam, met als leeropdracht Mathematische Besliskunde, in het...

The nature of the relationship Bill James found between the win/loss percentage of a Major League Baseball team and the number of runs the team scores and allows over the course of a season is investigated for the National Hockey League (NHL). We find the optimal form of James' model for the NHL...

One of the main points of criticism on academic research in operations research (management science ) is that there is too much emphasis on the mathematical aspects of the discipline. In particular, the mathematical models that lend themselves to rigorous mathematical analysis are often rough...

Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that strong...

In this paper we consider the Capacitated Arc Routing Problem with Time windows. We suggest two algorithms for solving the problem to optimality and a heuristic for obtaining high quality solutions. To our knowledge this is the first paper to consider optimal solution of that problem.

In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. The objective is to find a minimal cost production schedule such that dynamic...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...