Showing 1 - 1 of 1
In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that uses various combinatorial lower bounds....
Persistent link: https://www.econbiz.de/10010730890