Determining crane areas for balancing workload among interfering and noninterfering cranes



This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un-)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross-over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012