Showing 1 - 7 of 7
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/10011325639
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