When scheduling a round robin tournament (RRT) a Home-Away-Pattern (HAP) set defines for each team i and each period p whether i plays at home or away in p. So far the complexity of the decision problem whether a RRT can be arranged based on a given HAP set or not is open. We give a necessary...

A single round robin tournament (RRT) consists of a set T of n teams (n even) and a set P of n - 1 periods. The teams have to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period. In order to establish fairness among...

Interval robotic cells with several processing stages (chambers) have been increasingly used for diverse wafer fabrication processes in semi-conductor manufacturing. Processes such as low-pressure chemical vapor deposition, etching, cleaning and chemical-mechanical planarization, require strict...

This article considers the scheduling of flow shops with a common server that performs all material handling, including the transfer of parts between machines, in the context of robotic cell flow shops. Specifically, the first analytic study of the operations of a robotic cell in which one...

This paper considers a scheduling problem motivated by transshipment terminals. Trucks delivering or picking up items at the terminal have to be sequenced. Here, inventory constraints must be considered, that is the current inventory level implied by initial inventory level, total amount if pick...

The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...