Showing 1 - 10 of 137
Persistent link: https://www.econbiz.de/10003651892
Persistent link: https://www.econbiz.de/10003651922
Persistent link: https://www.econbiz.de/10002643920
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
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
This paper focuses on Single machine scheduling subject to inventory constraints. Jobs add and remove items to and from, respectively, the inventory. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a Single machine...
Persistent link: https://www.econbiz.de/10011558720
Persistent link: https://www.econbiz.de/10012096241
Persistent link: https://www.econbiz.de/10003633144
Persistent link: https://www.econbiz.de/10003651913