Abstract: This paper addresses the problem of minimising the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data are known in advance, the problem is efficiently solvable with a dynamic programming approach. However, this method is rarely applicable in practice for two reasons. First, the problem generally occurs in a real-time environment where the input data are revealed over time. Second, computing devices are in most cases not available in forklifts or gravity conveyors for decision-making. Online approach...
(read more)
Topics:
Mathematical optimization
Industrial engineering