Showing 1 - 10 of 30
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...
Persistent link: https://www.econbiz.de/10011558711
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,...
Persistent link: https://www.econbiz.de/10011558712
Persistent link: https://www.econbiz.de/10011325648
Persistent link: https://www.econbiz.de/10011325649
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
Persistent link: https://www.econbiz.de/10011558710
Persistent link: https://www.econbiz.de/10011325650
Persistent link: https://www.econbiz.de/10011325645
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...
Persistent link: https://www.econbiz.de/10011723705
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...
Persistent link: https://www.econbiz.de/10011723724
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...
Persistent link: https://www.econbiz.de/10011558707