Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...

This is a preview. Log in through your library . Abstract We study a deterministic maritime inventory routing problem with a long planning horizon. For instances with many ports and many vessels, ...

Two dynamic programming approaches for treating sequencing problems-one proposed by Schrage and Baker and the other by Lawler-are discussed in the context of an assembly line balancing problem. A ...