Matching uncertain demand with capacities is notoriously hard. Operationsmanagers can use mix-flexible resources to shift excess demands to unused capacities.To find the optimal configuration of a mix-flexible production network, aflexibility design problem (FDP) is solved. Existing literature...

Former generation capacity expansion models were formulated as optimization problems. Theseincluded a reliability criterion and hence guaranteed security of supply. The situation is differentin restructured markets where investments need to be incentivised by the margin resulting fromelectricity...

We consider capacity management with a long-term strategic choice, such as the number of production lines to install before demand is known, and short-time tactical decisions relating to production, inventory and subcontracting (recourse actions made after demand is known).[...]

We investigate the strategic impact of exible delivery frequencieson the competition of logistics service providers (LSPs) in a supplychain. LSPs compete for customers who choose an exclusive serviceprovider based on their individual preference, prices and inventorycosts. The service provider...

We propose a tactical model which integrates the replenishment decision in inventorymanagement, the allocation of products to warehousing systems and the assignment of products tostorage locations in warehousing management. The purpose of this article is to analyse the valueof integrating...

This paper compares the commonly-used periodic-review, replenishment interval, order-up-to (R, T) policy to the continuous review, reorder point, order quantity, (Q, r) model. [...]

Vorliegendes Arbeitspapier beschreibt den entsprechenden Einsatz künstlicher Ameisen und diskutiert erste numerische Ergebnisse.

In this paper we propose a multi-colony Ant System, where the colonies solve a multi-objective optimization problem concerned with goods transportation.

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem.(...)

The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also...