Kurze Durchlaufzeiten trotz kundenorientierter, variantenreicher Produktion sind in vielen Branchen Bestandteil einer unverzichtbaren Wettbewerbsstrategie. Da die unterschiedlichen Varianten i.d.R. in Konkurrenz um die verfügbare Kapazität der Fertigungsanlagen stehen, ist ein erhöhter...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

Generally speaking in sports competition a number of teams play against each other over a period of time according to a certain scheme. The round robin scheme is very popular in many team sports like soccer and basketball. In this paper we study several basic variants of round robin tournaments....

This paper addresses the multiple criteria flight gate assignment problem under uncertainty, which is naturally modeled by fuzzy numbers. The problem examined is a special kind of multicriteria multi-mode resource-constrained project scheduling problem with generalized precedence constraints or...

In general scheduling a sports league is a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three index assignment problem. The complexity of scheduling a round robin tournaments is settled by a reduction...