This paper studies inventory constraints in a machine scheduling environment. Jobs can add and remove items of different types to the inventory and from the inventory, respectively. Jobs removing items cannot be processed if the required amount of items is not available. We first have a look at...

We consider the problem of allocating containers to ships in which the size of container is 1 or 2, and each ship has its own capacity and fixed departure time. The fixed departure times implies the completion times of containers belonging to the same ship are identical. As objectives, Lmax,...

This paper studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1

A single round robin tournament (SRRT) consists of n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams we consider a...

Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. Moreover, stadium availability, fixed matches, and regions' capacities are taken into account. The goal is...

This paper deals with automated guided vehicles (AGVs) which transport containers between the quai and the stack on automated container terminals. The focus is on the assigment of transportation jobs to AGVs within a terminal control system operating in real time. First, we describe a rather...

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...

A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one...

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....

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...