A production system which consists of a number of parallel assembly lines is considered. Oneach line a certain product is manufactured observing a common cycle time. By arranging thelines in a favourable manner, it is possible to increase efficiency of the production system bycombining stations...

Assembly line balancing problems (ALBP) arise whenever an assembly line is configured,redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturingany unit of the products to be assembled among the work stations along the line subjectto a strict or average cycle...

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesignedor adjusted. An ALBP consists of distributing the total workload for manufacturingproducts among the work stations along the line. On the one hand, research has focussed on developingeffective and...

(...) Das Traveling-Salesman-Problem (TSP; synonym Handlungsreisenden- oder Rundreiseproblem) ist eine der populärsten kombinatorischen Problemstellungen der letzten vier Jahrzehnte. In seiner illustrativsten Formulierung unterstellt es einen Handlungsreisenden, welcher durch eine geeignete...

In this paper we analyze the evolution of output decisions of adaptive firms in an environment of oligopolistic competition. The firm might either choose to produce one of several existing product variants or try to establish a new product variant on the market....

In this paper we propose an ACO approach, where two colonies of ants aim to optimize total costs in a transportation network. This main objective consists of two sub goals, namely fleet size minimization and minimization of the vehicle movement costs, which are conflicting for some regions of...

In this paper we propose an ACO algorithm to optimize the total costs associated with the pickup and delivery of full truckloads under time window constraints in a hub network.(...)

We propose the use of robust optimization, a powerful tool that has already proven itself in several application areas, to the problem of finding optimal values for quantity exible commitment contracts between suppliers and retailers...

In order to maximize a piecewise affine concave function one can basically use the simplex method or an interior point method. As an alternative, we propose the face simplex method. The vertex to vertex scheme of the simplex method is replaced by a more general face to face scheme in the face...